相关论文: A Minimax Lemma and its Applications
This paper presents a decision-theoretic approach to statistical inference that satisfies the likelihood principle (LP) without using prior information. Unlike the Bayesian approach, which also satisfies LP, we do not assume knowledge of…
In this paper, we mainly give a general explicit form of Cassels' $p$-adic embedding theorem for number fields. We also give its refined form in the case of cyclotomic fields. As a byproduct, given an irreducible polynomial $f$ over $Z$, we…
We use multiplication maps to give a characteristic-free approach to vanishing theorems on toric varieties. Our approach is very elementary but is enough powerful to prove vanishing theorems.
Kuzmin-Landau Lemma basic for the bound of sum of exponentials is a nice example of the arithmetization of Analysis. Here we tell the interesting story of this Lemma emphasizing Landau's best constant.
The minimum dominating set problem has wide applications in network science and related fields. It consists of assembling a node set of global minimum size such that any node of the network is either in this set or is adjacent to at least…
This note is devotes to some remarks regarding the use of variational methods, of minimax type, to establish continuity type results
Archimedean copulas are a popular type of copulas in which a variant of the Archimedean axiom apply. We provide a topological proof of the Archimedean Axiom which is applicable for non-continuous distribution functions.
We give a short proof of Wolff-Denjoy theorem for (not necessarily smooth) strictly convex domains. With similar techniques we are also able to prove a Wolff-Denjoy theorem for weakly convex domains, again without any smoothness assumption…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
In this paper we define the closure under weak convergence of the class of p-tempered {\alpha}-stable distributions. We give necessary and sufficient conditions for convergence of sequences in this class. Moreover, we show that any element…
A decision rule is epsilon-minimax if it is minimax up to an additive factor epsilon. We present an algorithm for provably obtaining epsilon-minimax solutions for a class of statistical decision problems. In particular, we are interested in…
We establish that the min-sum message-passing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems.
We give a direct harmonic approximation lemma for local minima of quasiconvex multiple integrals that entails their $\mathrm{C}^{1,\alpha}$ or $\mathrm{C}^{\infty}$-partial regularity. Different from previous contributions, the method is…
The minimum status of a graph is the minimum of statuses of all vertices of this graph. We give a sharp upper bound for the minimum status of a connected graph with fixed order and matching number (domination number, respectively), and…
This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex. We show that no algorithm can reach an error $\epsilon$ in minimizing all functions from…
In the present paper we obtain a new homological version of the implicit function theorem and some versions of the Darboux theorem. Such results are proved for continuous maps on topological manifolds. As a consequence, some versions of…
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
A completeness theorem is proved involving a system of integro-differential equations with some $\lambda$-depending boundary conditions. Also some sufficient conditions for the root functions to form a Riesz basis are established.
A theorem of Mina evaluates the determinant of a matrix with entries $D^j(f(x)^i)$. We note the important special case where the matrix entries are evaluated at $x=0$ and give a simple proof of it, and some applications. We then give a…
We propose practical algorithms for entrywise $\ell_p$-norm low-rank approximation, for $p = 1$ or $p = \infty$. The proposed framework, which is non-convex and gradient-based, is easy to implement and typically attains better…