English
Related papers

Related papers: Toward a combination rule to deal with partial con…

200 papers

A randomised trapezoidal quadrature rule is proposed for continuous functions which enjoys less regularity than commonly required. Indeed, we consider functions in some fractional Sobolev space. Various error bounds for this randomised rule…

Numerical Analysis · Mathematics 2020-12-03 Yue Wu

The aim of this work is to provide a unified framework for ordinal representations of uncertainty lying at the crosswords between possibility and probability theories. Such confidence relations between events are commonly found in monotonic…

Artificial Intelligence · Computer Science 2012-08-07 Didier Dubois , Helene Fargier

The fractional Leibniz rule is generalized by the Coifman-Meyer estimate. It is shown that the arbitrary redistribution of fractional derivatives for higher order with the corresponding correction terms.

Analysis of PDEs · Mathematics 2019-01-01 Kazumasa Fujiwara , Vladimir Georgiev , Tohru Ozawa

Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution to this problem is to choose from several…

Artificial Intelligence · Computer Science 2007-05-23 G. Antoniou , D. Billigton , G. Governatori , M. J. Maher

We address one of the important problems in Big Data, namely how to combine estimators from different subsamples by robust fusion procedures, when we are unable to deal with the whole sample. We propose a general framework based on the…

Statistics Theory · Mathematics 2018-04-06 Catherine Aaron , Alejandro Cholaquidis , Ricardo Fraiman , Badih Ghattas

Many information sources are considered into data fusion in order to improve the decision in terms of uncertainty and imprecision. For each technique used for data fusion, the asumption on independance is usually made. We propose in this…

Artificial Intelligence · Computer Science 2015-01-23 Mouloud Kharoune , Arnaud Martin

We introduce a number of logics to reason about collective propositional attitudes that are defined by means of the majority rule. It is well known that majoritarian aggregation is subject to irrationality, as the results in social choice…

Logic in Computer Science · Computer Science 2017-11-13 Daniele Porello

An experiment replicated and extended recent findings on psychologically realistic ways of modeling propagation of uncertainty in rule based reasoning. Within a single production rule, the antecedent evidence can be summarized by taking the…

Artificial Intelligence · Computer Science 2021-07-02 Thomas R. Shultz

This paper deals with belief base revision that is a form of belief change consisting of the incorporation of new facts into an agent's beliefs represented by a finite set of propositional formulas. In the aim to guarantee more reliability…

Artificial Intelligence · Computer Science 2020-09-25 Raïda Ktari , Mohamed Ayman Boujelben

We consider the reaction diffusion problem and present efficient ways to discretize and precondition in the singular perturbed case when the reaction term dominates the equation. Using the concepts of optimal test norm and saddle point…

Numerical Analysis · Mathematics 2021-04-26 Constantin Bacuta , Daniel Hayes , Jacob Jacavage

We consider Lie and Strang splitting for the time integration of constrained partial differential equations with a nonlinear reaction term. Since such systems are known to be sensitive with respect to perturbations, the splitting procedure…

Numerical Analysis · Mathematics 2016-07-27 Robert Altmann , Alexander Ostermann

Consider a policymaker who wants to decide which intervention to perform in order to change a currently undesirable situation. The policymaker has at her disposal a team of experts, each with their own understanding of the causal…

Artificial Intelligence · Computer Science 2020-05-21 Dalal Alrajeh , Hana Chockler , Joseph Y. Halpern

The problem of convergence in law of normed sums of exchangeable random variables is examined. First, the problem is studied w.r.t. arrays of exchangeable random variables, and the special role played by mixtures of products of stable laws…

Probability · Mathematics 2012-04-20 Sandra Fortini , Lucia Ladelli , Eugenio Regazzini

When using complex Bayesian models to combine information, the checking for consistency of the information being combined is good statistical practice. Here a new method is developed for detecting prior-data conflicts in Bayesian models…

Methodology · Statistics 2016-11-29 David J. Nott , Xueou Wang , Michael Evans , Berthold-Georg Englert

To devise efficient solutions for approximating a mean partition in consensus clustering, Dimitriadou et al. [3] presented a necessary condition of optimality for a consensus function based on least square distances. We show that their…

Machine Learning · Computer Science 2016-04-27 Brijnesh J. Jain

We introduce a novel rule-based approach for handling regression problems. The new methodology carries elements from two frameworks: (i) it provides information about the uncertainty of the parameters of interest using Bayesian inference,…

Machine Learning · Statistics 2021-10-11 Themistoklis Botsas , Lachlan R. Mason , Indranil Pan

In this paper we formulate the problem of inference under incomplete information in very general terms. This includes modelling the process responsible for the incompleteness, which we call the incompleteness process. We allow the process…

Artificial Intelligence · Computer Science 2014-01-16 Marco Zaffalon , Enrique Miranda

One of the better studied properties for operators in judgment aggregation is independence, which essentially dictates that the collective judgment on one issue should not depend on the individual judgments given on some other issue(s) in…

Artificial Intelligence · Computer Science 2016-04-25 Jérôme Lang , Marija Slavkovik , Srdjan Vesic

We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…

Combinatorics · Mathematics 2025-11-12 Andrew Li , Hua Wang

We derive a conditional version of the classical regret-capacity theorem. This result can be used in universal prediction to find lower bounds on the minimal batch regret, which is a recently introduced generalization of the average regret,…

Information Theory · Computer Science 2025-08-15 Marco Bondaschi , Michael Gastpar