paper-with-me

Papers

An Inequality Paradigm for Probabilistic Knowledge

2013-03-27 · Benjamin N. Grosof

We propose an inequality paradigm for probabilistic reasoning based on a logic of upper and lower bounds on conditional probabilities. We investigate a family of probabilistic logics, generalizing the work of Nilsson [14]. We develop a variety of logical notions for probabilistic reasoning, including soundness, completeness justification; and convergence: reduction of a theory to a simpler logical class. We argue that a bound view is especially useful for describing the semantics of probabilistic knowledge representation and for describing intermediate states of probabilistic inference and updating. We show that the Dempster-Shafer theory of evidence is formally identical to a special case of our generalized probabilistic logic. Our paradigm thus incorporates both Bayesian "rule-based" approaches and avowedly non-Bayesian "evidential" approaches such as MYCIN and DempsterShafer. We suggest how to integrate the two "schools", and explore some possibilities for novel synthesis of a variety of ideas in probabilistic reasoning.

📄 PDF Abstract BibTeX arXiv:1304.3418

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

A Reverse Jensen Inequality Result with Application to Mutual Information Estimation

2021-11-12 · Gerhard Wunder, Benedikt Groß, Rick Fritschek, Rafael F. Schaefer

The Jensen inequality is a widely used tool in a multitude of fields, such as for example information theory and machine learning. It can be also used to derive other standard inequalities such as the inequality of arith…

Mutual Information Estimation

Generalized Inequality-based Approach for Probabilistic WCET Estimation

2025-11-12 · Hayate Toba, Atsushi Yano, Takuya Azumi arxiv

Estimating the probabilistic Worst-Case Execution Time (pWCET) is essential for ensuring the timing correctness of real-time applications, such as in robot IoT systems and autonomous driving systems. While methods based …

Autonomous Driving

Resilience of Rademacher chaos of low degree

2024-02-16 · Elad Aigner-Horev, Daniel Rosenberg, Roi Weiss

The resilience of a Rademacher chaos is the maximum number of adversarial sign-flips that the chaos can sustain without having its largest atom probability significantly altered. Inspired by probabilistic lower-bound gua…

Gaussian Processes

The Context Access Divide: Interaction-Level Architecture as a Complementary Dimension of Agentic Inequality

2026-07-09 · Masahiro Fujita arxiv

Sharp et al. (2025) introduce "agentic inequality" as a framework for analyzing disparities in access to AI agents across three dimensions: availability, quality, and quantity. These person- and organization-level dimens…

Wasserstein bounds for denoising diffusion probabilistic models via the Föllmer process

2026-05-18 · Yuta Koike arxiv

This paper studies sampling error bounds for denoising diffusion probabilistic models (DDPMs) in the 2-Wasserstein distance. Our contributions are threefold. (i) Under general Lipschitz-type conditions on the score funct…