Optimal lower bounds for bivariate probabilities

被引:4
|
作者
Chen, TH [1 ]
机构
[1] Univ Sydney, Sydney, NSW 2006, Australia
关键词
Frechet optimality; linear programming; probability space; iteration; optimization; cycling; perturbation;
D O I
10.1017/S0001867800047388
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
This paper deals with existence of bivariate Frechet optimal lower bounds for two sets of events, and provides a practical approach to find this kind of bound. The main device used is linear programming ideas, coupled with construction of probability spaces. The highlight of this paper is that perturbation terms in the optimization process, even when a tie occurs, are not necessary in this practical implementation.
引用
收藏
页码:476 / 492
页数:17
相关论文
共 50 条
  • [41] Towards optimal lower bounds for clique and chromatic number
    Engebretsen, L
    Holmerin, J
    THEORETICAL COMPUTER SCIENCE, 2003, 299 (1-3) : 537 - 584
  • [42] Lower Bounds on Adversarial Robustness from Optimal Transport
    Bhagoji, Arjun Nitin
    Cullina, Daniel
    Mittal, Prateek
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [44] DUALITY AND LOWER BOUNDS IN OPTIMAL STOCHASTIC-CONTROL
    TANIMOTO, S
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1994, 25 (08) : 1365 - 1372
  • [45] Optimal quantum adversary lower bounds for ordered search
    Childs, Andrew M.
    Lee, Troy
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, PROCEEDINGS, 2008, 5125 : 869 - +
  • [46] Optimal Lower Bounds for Projective List Update Algorithms
    Ambuehl, Christoph
    Gaertner, Bernd
    von Stengel, Bernhard
    ACM TRANSACTIONS ON ALGORITHMS, 2013, 9 (04)
  • [47] Lower Bounds on the Optimal Control of Soft Tissue Grasping
    Yu, Xiaolong
    Chizeck, Howard Jay
    2008 30th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, Vols 1-8, 2008, : 1943 - 1947
  • [48] Lower Bounds for the Smoothed Number of Pareto Optimal Solutions
    Brunsch, Tobias
    Roeglin, Heiko
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 2011, 6648 : 416 - 427
  • [49] Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms
    Combes, Richard
    Proutiere, Alexandre
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 32 (CYCLE 1), 2014, 32
  • [50] Lower Bounds and Optimal Algorithms for Personalized Federated Learning
    Hanzely, Filip
    Hanzely, Slavomir
    Horvath, Samuel
    Richtarik, Peter
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33