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 条
  • [1] Extending Nearly-Linear Models
    Pelessoni, Renato
    Vicig, Paolo
    Corsato, Chiara
    PROCEEDINGS OF THE ELEVENTH INTERNATIONAL SYMPOSIUM ON IMPRECISE PROBABILITIES: THEORIES AND APPLICATIONS (ISIPTA 2019), 2019, 103 : 82 - 90
  • [2] Inference with Nearly-Linear uncertainty models
    Pelessoni, Renato
    Vicig, Paolo
    Corsato, Chiara
    FUZZY SETS AND SYSTEMS, 2021, 412 : 1 - 26
  • [3] Nearly-Linear uncertainty measures
    Corsato, Chiara
    Pelessoni, Renato
    Vicig, Paolo
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2019, 114 : 1 - 28
  • [4] BILEVEL FEATURE SELECTION IN NEARLY-LINEAR TIME
    Hegde, Chinmay
    2016 IEEE STATISTICAL SIGNAL PROCESSING WORKSHOP (SSP), 2016,
  • [5] Better Approximations for Tree Sparsity in Nearly-Linear Time
    Backurs, Arturs
    Indyk, Piotr
    Schmidt, Ludwig
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 2215 - 2229
  • [6] Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time
    Dhulipala, Laxman
    Eisenstat, David
    Lacki, Jakub
    Mirrokni, Vahab
    Shi, Jessica
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [7] Group isomorphism is nearly-linear time for most orders
    Dietrich, Heiko
    Wilson, James B.
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 457 - 467
  • [8] Sorting Signed Permutations by Reversals in Nearly-Linear Time
    Dudek, Bartiomiej
    Gawrychowski, Pawel
    Starikovskaya, Tatiana
    2024 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2024, : 199 - 214
  • [9] A Nearly-Linear Time Framework for Graph-Structured Sparsity
    Hegde, Chinmay
    Indyk, Piotr
    Schmidt, Ludwig
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 37, 2015, 37 : 928 - 937
  • [10] Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs
    van den Brand, Jan
    Lee, Yin-Tat
    Nanongkai, Danupon
    Peng, Richard
    Saranurak, Thatchaphol
    Sidford, Aaron
    Song, Zhao
    Wang, Di
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 919 - 930