Related papers: Complementability and maximality in different cont…
The ellipsoid fitting conjecture of Saunderson, Chandrasekaran, Parrilo and Willsky considers the maximum number $n$ random Gaussian points in $\mathbb{R}^d$, such that with high probability, there exists an origin-symmetric ellipsoid…
The ``multiple of the inclusion plus compact problem'' which was posed by T.W. Gowers in 1996 and Th. Schlumprecht in 2003, asks whether for every infinite dimensional Banach space $X$ there exists a closed subspace $Y$ of $X$ and a bounded…
A composite likelihood is a non-genuine likelihood function that allows to make inference on limited aspects of a model, such as marginal or conditional distributions. Composite likelihoods are not proper likelihoods and need therefore…
We introduce enriched notions of purity depending on the left class $\mathcal E$ of a factorization system on the base $\mathcal V$ of enrichment. Ordinary purity is given by the class of surjective mappings in the category of sets. Under…
This paper is a review of a particular approach to the method of maximum entropy as a general framework for inference. The discussion emphasizes the pragmatic elements in the derivation. An epistemic notion of information is defined in…
The paper introduces mixed networks, a new framework for expressing and reasoning with probabilistic and deterministic information. The framework combines belief networks with constraint networks, defining the semantics and graphical…
We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices.…
Previous work (Frank and Satta 1998; Karttunen, 1998) has shown that Optimality Theory with gradient constraints generally is not finite state. A new finite-state treatment of gradient constraints is presented which improves upon the…
S. Artstein, K. Ball, F. Barthe, and A. Naor have shown that if (X_j) are i.i.d. random variables, then the entropy of n^{-1/2}(X_1+....+X_n) increases as n increases. The free analogue was recently proven by D. Shlyakhtenko. That is, if…
Let $F$ be a $p$-adic field. Let $\mathcal{R}$ be the Grothendieck ring of complex smooth finite-length representations of the groups $\{GL_n(F)\}_{n=0}^\infty$ taken together, with multiplication defined in the sense of parabolic…
In this paper, we introduce the notions of $\alpha$-quasicomplemented and totally $\alpha$-quasicomplemented subspaces and we established some results under these contexts. We show, for example, that if $X$ is a separable or reflexive…
We examine the {combinatorial} or {probabilistic} definition ("Boltzmann's principle") of the entropy or cross-entropy function $H \propto \ln \mathbb{W}$ or $D \propto - \ln \mathbb{P}$, where $\mathbb{W}$ is the statistical weight and…
For estimating a lower bounded parametric function in the framework of Marchand and Strawderman (2006), we provide through a unified approach a class of Bayesian confidence intervals with credibility $1-\alpha$ and frequentist coverage…
This study proposes a computationally efficient semiparametric distribution estimator, which is a slight modification of the naive mixture proposed by Schuster and Yakowitz (1985) and Olkin and Spiegelman (1987). The proposed method is…
In 1991 J.F. Aarnes introduced the concept of quasi-measures in a compact topological space $\Omega$ and established the connection between quasi-states on $C (\Omega)$ and quasi-measures in $\Omega$. This work solved the linearity problem…
Lettericity is a graph parameter introduced by Petkov\v{s}ek in 2002 in order to study well-quasi-orderability under the induced subgraph relation. In the world of permutations, geometric griddability was independently introduced in 2013 by…
In this paper, we study the dual problem of the expected utility maximization in incomplete markets with bounded random endowment. We start with the problem formulated in the paper of Cvitani\'{c}-Schachermayer-Wang (2001) and prove the…
For every list of integers x_1, ..., x_m there is some j such that x_1 + ... + x_j - x_{j+1} - ... - x_m \approx 0. So the list can be nearly balanced and for this we only need one alternation between addition and subtraction. But what if…
We give a proof of the conjecture of Nelson and Nguyen [FOCS 2013] on the optimal dimension and sparsity of oblivious subspace embeddings, up to sub-polylogarithmic factors: For any $n\geq d$ and $\epsilon\geq d^{-O(1)}$, there is a random…
Unlike the Probability Theory based on additivity, Statistical Inference seems to hesitate between "Additivity" and a so-called "Maxitivity" approach. After a brief overview of three types of principles for any (parametric) statistical…