Related papers: Minimization of entropy functionals
Compact data representations are one approach for improving generalization of learned functions. We explicitly illustrate the relationship between entropy and cardinality, both measures of compactness, including how gradient descent on the…
A min-max formula is proved for the minimum of an integer-valued separable discrete convex function where the minimum is taken over the set of integral elements of a box total dual integral (box-TDI) polyhedron. One variant of the theorem…
This article deals with topological assumptions under which the minimal volume entropy of a closed manifold, and more generally of a finite simplicial complex, vanishes or is positive. In the first part of the article, we present…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
We consider the problem of minimizing the sum of submodular set functions assuming minimization oracles of each summand function. Most existing approaches reformulate the problem as the convex minimization of the sum of the corresponding…
This paper studies loss functions for finite sets. For a given finite set $S$, we give sum-of-square type loss functions of minimum degree. When $S$ is the vertex set of a standard simplex, we show such loss functions have no spurious…
In this paper provide sufficient and necessary conditions for the minimax equality for extended-valued $\Phi$-convex functions. As an application we establish sufficient and necessary conditions for the minimax equality for convex-concave…
Maximization of an expensive, unimodal function under random observations has been an important problem in hyperparameter tuning. It features expensive function evaluations (which means small budgets) and a high level of noise. We develop…
Minimum divergence problems under integral constraints appear throughout statistics and probability, including sequential inference, bandit theory, and distributionally robust optimization. In many such settings, dual representations are…
A broad set of sufficient conditions that guarantees the existence of the maximum entropy (maxent) distribution consistent with specified bounds on certain generalized moments is derived. Most results in the literature are either focused on…
We develop a technique for establishing lower bounds on the sample complexity of Least Squares (or, Empirical Risk Minimization) for large classes of functions. As an application, we settle an open problem regarding optimality of Least…
Submodular continuous functions are a category of (generally) non-convex/non-concave functions with a wide spectrum of applications. We characterize these functions and demonstrate that they can be maximized efficiently with approximation…
In this paper we introduce a weak version of level and epigraph convergence for level functions on topological spaces. In the particular case of topological groups we are able to define convolutions in the set of level functions and show…
The notion of ordinal concavity of utility functions has recently been considered by Hafalir, Kojima, Yenmez, and Yokote in economics while there exist earlier related works in discrete optimization and operations research. In the present…
DR-submodular functions encompass a broad class of functions which are generally non-convex and non-concave. We study the problem of minimizing any DR-submodular function, with continuous and general integer variables, under box constraints…
In the first part of this doctoral thesis we develop a regularity theory for a polyconvex functional in compressible elasticity. In the second part, we will concentrate on uniqueness questions in various situations of finite elasticity.…
A formula for the sub\-differential of the sum of a series of convex functions defined on a Banach space was provided by X. Y. Zheng in 1998. In this paper, besides a slight extension to locally convex spaces of Zheng's results, we provide…
This paper extends the algorithm schemes proposed in \cite{Nesterov2007a} and \cite{Nesterov2007b} to the minimization of the sum of a composite objective function and a convex function. Two proximal point-type schemes are provided and…
A formulation of the density functional theory is constructed on the foundations of entropic inference. The theory is introduced as an application of maximum entropy for inhomogeneous fluids in thermal equilibrium. It is shown that entropic…
Multiscale periodic homogenization is extended to an Orlicz-Sobolev setting. It is shown by the reiteraded periodic two-scale convergence method that the sequence of minimizers of a class of highly oscillatory minimizations problems…