English
Related papers

Related papers: Axiomatic Foundations for a Class of Generalized E…

200 papers

A certain generalization of the mathematical formalism of quantum mechanics beyond operator algebras is considered. The approach is based on the concept of conditional probability and the interpretation of the Lueders - von Neumann quantum…

Mathematical Physics · Physics 2010-01-21 Gerd Niestegge

We determine when there is a unique conditional expectation from a semifinite von Neumann algebra onto a singly-generated maximal abelian *-subalgebra. Our work extends the results of Kadison and Singer via new methods, notably the…

Operator Algebras · Mathematics 2009-06-11 Charles A. Akemann , David Sherman

The maximum entropy principle can be used to assign utility values when only partial information is available about the decision maker's preferences. In order to obtain such utility values it is necessary to establish an analogy between…

Statistical Finance · Quantitative Finance 2009-11-13 Andreia Dionisio , A. Heitor Reis

In previous work cite{Ha98:Towards} we presented a case-based approach to eliciting and reasoning with preferences. A key issue in this approach is the definition of similarity between user preferences. We introduced the probabilistic…

Artificial Intelligence · Computer Science 2013-01-14 Vu A. Ha , Peter Haddawy , John Miyamoto

An abstract mathematical framework is presented in this paper as a unification of several deformed or generalized algebra proposed recently in the context of generalized statistical theories intended to treat certain complex thermodynamic…

Statistical Mechanics · Physics 2020-10-20 Aziz El Kaabouchi , Laurent Nivanen , Qiuping A. Wang , Jean-Pierre Badiali , Alain Le Méhauté

We give a complete first-order axiomatization of the structure $(\mathbb{Z},+,(\ell^{\mathbb{N}})_{\ell\in L})$, where $L \subseteq \mathbb{Z}_{\ge 2}$ is a set of pairwise multiplicatively independent integers and $\ell^{\mathbb{N}} =…

Logic · Mathematics 2026-02-24 Philipp Hieronymi , Michael Reitmeir , Xiaoduo Wang

Tackling the problem of ordinal preference revelation and reasoning, we propose a novel methodology for generating an ordinal utility function from a set of qualitative preference statements. To the best of our knowledge, our proposal…

Artificial Intelligence · Computer Science 2012-07-09 Carmel Domshlak , Thorsten Joachims

We develop a tractable model of realization utility that studies the role of reference-dependent S-shaped preferences in a dynamic investment setting with reinvestment. Our model generates both voluntarily realized gains and losses. It…

General Finance · Quantitative Finance 2014-08-14 Jonathan E. Ingersoll , Lawrence J. Jin

User preferences for automated assistance often vary widely, depending on the situation, and quality or presentation of help. Developing effectivemodels to learn individual preferences online requires domain models that associate…

Artificial Intelligence · Computer Science 2012-06-18 Bowen Hui , Craig Boutilier

This paper addresses a significant gap in explainable AI: the necessity of interpreting epistemic uncertainty in model explanations. Although current methods mainly focus on explaining predictions, with some including uncertainty, they fail…

Artificial Intelligence · Computer Science 2024-10-10 Helena Löfström , Tuwe Löfström , Johan Hallberg Szabadvary

Instead of testing for unanimous agreement, I propose learning how broad of a consensus favors one distribution over another (of earnings, productivity, asset returns, test scores, etc.). Specifically, given a sample from each of two…

Econometrics · Economics 2024-08-27 David M. Kaplan

Quantitative algebras (QAs) are algebras over metric spaces defined by quantitative equational theories as introduced by the same authors in a related paper presented at LICS 2016. These algebras provide the mathematical foundation for…

Logic in Computer Science · Computer Science 2018-04-06 Radu Mardare , Prakash Panangaden , Gordon Plotkin

In the context of aggregating von Neumann-Morgenstern utilities, we show that bounded violations of the Pareto conditions characterize aggregation rules that are approximately utilitarian. When a single utility function is intended to…

Theoretical Economics · Economics 2026-05-18 Leandro Nascimento

Perfectly rational decision-makers maximize expected utility, but crucially ignore the resource costs incurred when determining optimal actions. Here we employ an axiomatic framework for bounded rational decision-making based on a…

Artificial Intelligence · Computer Science 2011-07-29 Pedro A. Ortega , Daniel A. Braun

Real-valued logics underlie an increasing number of neuro-symbolic approaches, though typically their logical inference capabilities are characterized only qualitatively. We provide foundations for establishing the correctness and power of…

Logic in Computer Science · Computer Science 2022-09-01 Ronald Fagin , Ryan Riegel , Alexander Gray

In this paper we consider the axiomatic characterization of information and certainty measures in a unified way. We present the general axiomatic system which captures the common properties of a large number of the measures previously…

Information Theory · Computer Science 2015-06-17 Velimir M. Ilic , Miomir S. Stankovic

Bayesian decision theory outlines a rigorous framework for making optimal decisions based on maximizing expected utility over a model posterior. However, practitioners often do not have access to the full posterior and resort to approximate…

Machine Learning · Statistics 2019-10-29 Tomasz Kuśmierczyk , Joseph Sakaya , Arto Klami

Group fairness definitions such as Demographic Parity and Equal Opportunity make assumptions about the underlying decision-problem that restrict them to classification problems. Prior work has translated these definitions to other machine…

Machine Learning · Computer Science 2023-11-28 Jack Blandin , Ian Kash

This work introduces a novel framework of uniform realizability that unifies and generalizes various realizability interpretations of logic, particularly focussing on the treatment of atomic formulas and quantifiers. Traditional…

Logic in Computer Science · Computer Science 2026-03-05 Ulrich Berger , Paulo Oliva

Statistics and Optimization are foundational to modern Machine Learning. Here, we propose an alternative foundation based on Abstract Algebra, with mathematics that facilitates the analysis of learning. In this approach, the goal of the…

Machine Learning · Computer Science 2025-02-28 Fernando Martin-Maroto , Nabil Abderrahaman , David Mendez , Gonzalo G. de Polavieja
‹ Prev 1 8 9 10 Next ›