Dilation properties of coherent Nearly-Linear models

被引:2
|
作者
Pelessoni, Renato [1 ]
Vicig, Paolo [1 ]
机构
[1] Univ Trieste, DEAMS, Piazzale Europa 1, I-34127 Trieste, Italy
关键词
Nearly-Linear models; Dilation; Constriction; Coarsening; Extent of dilation; Coherent lower/upper probabilities; INFERENCE;
D O I
10.1016/j.ijar.2021.10.009
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Dilation is a puzzling phenomenon within Imprecise Probability theory: when it obtains, our uncertainty evaluation on event A is vaguer after conditioning A on B, whatever is event B in a given partition B. In this paper we investigate dilation with coherent Nearly-Linear (NL) models. These are a family of neighbourhood models, obtaining lower/upper probabilities by linear affine transformations (with barriers) of a given probability, and encompass several well-known models, such as the Pari-Mutuel Model, the epsilon-contamination model, the Total Variation Model, and others. We first recall results we recently obtained for conditioning NL model with the standard procedure of natural extension and separately discuss the role of the alternative regular extension. Then, we characterise dilation for coherent NL models. For their most relevant subfamily, Vertical Barrier Models (VBM), we study the coarsening property of dilation, the extent of dilation, and constriction. The results generalise existing ones established for special VBMs. As an interesting aside, we discuss in a general framework how logical (in)dependence of A from B or extreme evaluations for A influence dilation. (C) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页码:211 / 231
页数:21
相关论文
共 50 条
  • [21] Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time
    Chekuri, Chandra
    Quanrud, Kent
    2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2017, : 789 - 800
  • [22] Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication
    HajiAghayi, Mohammad T.
    Kowalski, Dariusz R.
    Olkowski, Jan
    Leibniz International Proceedings in Informatics, LIPIcs, 297
  • [23] Two "Dual" families of nearly-linear codes over Ζp,p odd
    van Asch, B
    van Tilborg, HCA
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2001, 11 (04) : 313 - 329
  • [24] Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver
    Hoske, Daniel
    Lukarski, Dimitar
    Meyerhenke, Henning
    Wegner, Michael
    EXPERIMENTAL ALGORITHMS, SEA 2015, 2015, 9125 : 205 - 218
  • [25] Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity
    Dong, Sally
    Jiang, Haotian
    Lee, Yin Tat
    Padmanabhan, Swati
    Ye, Guanghao
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35, NEURIPS 2022, 2022,
  • [26] Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations
    Cohen, Michael B.
    Kelner, Jonathan
    Kyng, Rasmus
    Peebles, John
    Peng, Richard
    Rao, Anup B.
    Sidford, Aaron
    2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2018, : 898 - 909
  • [27] A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path
    Dong, Sally
    Lee, Yin Tat
    Ye, Guanghao
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 1784 - 1797
  • [28] Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
    Chiesa, Alessandro
    Gur, Tom
    Shinkar, Igor
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1395 - 1411
  • [29] Spectral Graph Sparsification in Nearly-Linear Time Leveraging Efficient Spectral Perturbation Analysis
    Feng, Zhuo
    2016 ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2016,
  • [30] RELAXED LOCALLY CORRECTABLE CODES WITH NEARLY-LINEAR BLOCK LENGTH AND CONSTANT QUERY COMPLEXITY
    Chiesa, Alessandro
    Gur, Tom
    Shinkar, Igor
    SIAM JOURNAL ON COMPUTING, 2022, 51 (06) : 1839 - 1865