English
Related papers

Related papers: Generalized Dual Sudakov Minoration via Dimension …

200 papers

In applications throughout science and engineering one is often faced with the challenge of solving an ill-posed inverse problem, where the number of available measurements is smaller than the dimension of the model to be estimated. However…

Optimization and Control · Mathematics 2012-10-30 Venkat Chandrasekaran , Benjamin Recht , Pablo A. Parrilo , Alan S. Willsky

Bi-log-concavity of probability measures is a univariate extension of the notion of log-concavity that has been recently proposed in a statistical literature. Among other things, it has the nice property from a modelisation perspective to…

Probability · Mathematics 2019-03-20 Adrien Saumard

The problem of minimizing a continuously differentiable convex function over an intersection of closed convex sets is ubiquitous in applied mathematics. It is particularly interesting when it is easy to project onto each separate set, but…

Optimization and Control · Mathematics 2014-08-06 Eric C. Chi , Hua Zhou , Kenneth Lange

We study a version of the Busemann-Petty problem for $\log$-concave measures with an additional assumption on the dilates of convex, symmetric bodies. One of our main tools is an analog of the classical large deviation principle applied to…

Probability · Mathematics 2025-02-19 Malak Lafi , Artem Zvavitch

In the literature, the Minkowski-sum and the metric-sum of compact sets are highlighted. While the first is associative, the latter is not. But the major drawback of the Minkowski combination is that, by increasing the number of summands,…

Dynamical Systems · Mathematics 2025-04-16 Ekta Agrawal , Saurabh Verma

We prove Gaussian approximation theorems for specific $k$-dimensional marginals of convex bodies which possess certain symmetries. In particular, we treat bodies which possess a 1-unconditional basis, as well as simplices. Our results…

Metric Geometry · Mathematics 2009-01-09 Mark W. Meckes

We introduce notions of dimension of an infinite group, or more generally, a metric space, defined using percolation. Roughly speaking, the percolation dimension $pdim(G)$ of a group $G$ is the fastest rate of decay of a symmetric…

Probability · Mathematics 2024-04-29 Agelos Georgakopoulos

This paper considers a general convex constrained problem setting where functions are not assumed to be differentiable nor Lipschitz continuous. Our motivation is in finding a simple first-order method for solving a wide range of convex…

Optimization and Control · Mathematics 2021-03-19 Michael R. Metel , Akiko Takeda

In a recent issue of this journal, Mordukhovich et al.\ pose and solve an interesting non-differentiable generalization of the Heron problem in the framework of modern convex analysis. In the generalized Heron problem one is given $k+1$…

Optimization and Control · Mathematics 2015-03-20 Eric C. Chi , Kenneth Lange

This paper develops a method for obtaining guaranteed outer approximations for global attractors of continuous and discrete time nonlinear dynamical systems. The method is based on a hierarchy of semidefinite programming problems of…

Optimization and Control · Mathematics 2023-10-05 Corbinian Schlosser , Milan Korda

In this paper we imitate the traditional method which is used customarily in the General Relativity and some mathematical literatures to derive the Gauss-Codazzi-Ricci equations for dimensional reduction. It would be more distinct…

High Energy Physics - Theory · Physics 2014-11-18 Pei Wang

We study the sublinear multivariate mean estimation problem in $d$-dimensional Euclidean space. Specifically, we aim to find the mean $\mu$ of a ground point set $A$, which minimizes the sum of squared Euclidean distances of the points in…

Data Structures and Algorithms · Computer Science 2025-10-07 Beatrice Bertolotti , Matteo Russo , Chris Schwiegelshohn , Sudarshan Shyam

Many geometric optimization problems can be reduced to finding points in space (centers) minimizing an objective function which continuously depends on the distances from the centers to given input points. Examples are $k$-Means, Geometric…

Computational Geometry · Computer Science 2021-08-26 Vladimir Shenmaier

We develop a new randomized iterative algorithm---stochastic dual ascent (SDA)---for finding the projection of a given vector onto the solution space of a linear system. The method is dual in nature: with the dual being a non-strongly…

Numerical Analysis · Mathematics 2016-01-29 Robert Mansel Gower , Peter Richtarik

We prove a weak version of the $\varepsilon$-Dvoretzky conjecture for normed spaces, showing the existence of a subspace of $\mathbb{R}^n$ of dimension at least $c \log n / |\log \varepsilon|$ in which the given norm is $\varepsilon$-close…

Functional Analysis · Mathematics 2023-07-28 Bo'az Klartag , Tomer Novikov

In this paper we study the functional given by the integral of the mean curvature of a convex set with Gaussian weight with Gaussian volume constraint. It was conjectured that the ball centered at the origin is the only minimizer of such a…

Analysis of PDEs · Mathematics 2024-05-22 Nicola Fusco , Domenico Angelo La Manna

A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…

High Energy Physics - Theory · Physics 2008-11-26 Pierre Mathieu , David Ridout

In the usual procedure for toroidal Kaluza-Klein reduction, all the higher-dimensional fields are taken to be independent of the coordinates on the internal space. It has recently been observed that a generalisation of this procedure is…

High Energy Physics - Theory · Physics 2009-10-07 I. V. Lavrinenko , H. Lu , C. N. Pope

We derive a general large deviation principle for a canonical sequence of probability measures, having its origins in random matrix theory, on unbounded sets $K$ of ${\bf C}$ with weakly admissible external fields $Q$ and very general…

Probability · Mathematics 2019-04-29 T. Bloom , N. Levenberg , F. Wielonsky

The generalized lasso is a natural generalization of the celebrated lasso approach to handle structural regularization problems. Many important methods and applications fall into this framework, including fused lasso, clustered lasso, and…

Machine Learning · Statistics 2025-01-07 Jianmin Chen , Kun Chen
‹ Prev 1 4 5 6 7 8 10 Next ›