English
Related papers

Related papers: Minimal Root's embeddings for general starting and…

200 papers

We formalize and study the natural approach of designing convex surrogate loss functions via embeddings, for problems such as classification, ranking, or structured prediction. In this approach, one embeds each of the finitely many…

Machine Learning · Computer Science 2022-01-12 Jessie Finocchiaro , Rafael Frongillo , Bo Waggoner

Recently, the worse-case analysis, probabilistic analysis and empirical justification have been employed to address the fundamental question: When does $\ell_1$-minimization find the sparsest solution to an underdetermined linear system? In…

Information Theory · Computer Science 2015-06-16 Yunbin Zhao

In this paper, we develop a general existence theory for properly embedded minimal surfaces with free boundary in any compact Riemannian 3-manifold $M$ with boundary $\partial M$. The main feature of our result is that no convexity…

Differential Geometry · Mathematics 2020-01-06 Martin Li

This paper explores some sufficient conditions for the enhanced solvability of strong vector equilibrium problems, which can be established via a variational approach. Enhanced solvability here means existence of solutions, which are strong…

Optimization and Control · Mathematics 2022-05-11 Amos Uderzo

The submodular partitioning problem asks to minimize, over all partitions $P$ of a ground set $V$, the sum of a given submodular function $f$ over the parts of $P$. The problem has seen considerable work in approximability, as it…

Data Structures and Algorithms · Computer Science 2025-07-03 Kristóf Bérczi , Karthekeyan Chandrasekaran , Tamás Király , Daniel P. Szabo

Loss functions with non-isolated minima have emerged in several machine learning problems, creating a gap between theory and practice. In this paper, we formulate a new type of local convexity condition that is suitable to describe the…

Machine Learning · Computer Science 2022-05-31 Taehee Ko , Xiantao Li

Regularity results for minimal configurations of variational problems involving both bulk and surface energies and subject to a volume constraint are established. The bulk energies are convex functions with p-power growth, but are otherwise…

Analysis of PDEs · Mathematics 2015-04-16 Menita Carozza , Irene Fonseca , Antonia Passarelli di Napoli

For unconstrained control problems, a local convergence rate is established for an $hp$-method based on collocation at the Radau quadrature points in each mesh interval of the discretization. If the continuous problem has a sufficiently…

Numerical Analysis · Mathematics 2021-07-20 William W. Hager , Hongyan Hou , Subhashree Mohapatra , Anil V. Rao

We prove that minimizers of variational problems on open sets $\Omega \subset \mathbb{R}^n$ $$ \mbox{minimize}\quad \mathcal E(v)=\int_\Omega f(v(x))\mathrm{d} x\quad\text{for } \mathscr{A} v=0, $$ are partially continuous provided that the…

Analysis of PDEs · Mathematics 2026-04-09 Zhuolin Li , Bogdan Raiţă

The purpose of this paper is to characterize the weak efficient solutions, the efficient solutions, and the isolated efficient solutions of a given vector optimization problem with finitely many convex objective functions and infinitely…

Optimization and Control · Mathematics 2016-08-11 Miguel A. Goberna , Nader Kanzi

We study the joint laws of a continuous, uniformly integrable martingale, its maximum, and its minimum. In particular, we give explicit martingale inequalities which provide upper and lower bounds on the joint exit probabilities of a…

Probability · Mathematics 2015-03-31 Alexander M. G. Cox , Jan Obłój

We study the problem of maximizing R{\'e}nyi entropy of order $2$ (equivalently, minimizing the index of coincidence) over the set of joint distributions with prescribed marginals. A closed-form optimizer is known under a feasibility…

Information Theory · Computer Science 2026-02-09 Pierre Jean-Claude Robert Bertrand

We develop an explicit non-randomized solution to the Skorokhod embedding problem in an abstract setup of signed functionals of Markovian excursions. Our setting allows to solve the Skorokhod embedding problem, in particular, for diffusions…

Probability · Mathematics 2007-05-23 Jan Obloj

We study the existing algorithms that solve the multidimensional martingale optimal transport. Then we provide a new algorithm based on entropic regularization and Newton's method. Then we provide theoretical convergence rate results and we…

Probability · Mathematics 2018-12-31 Hadrien De March

This work introduces the extended Skorokhod problem (ESP) and associated extended Skorokhod map (ESM) that enable a pathwise construction of reflected diffusions that are not necessarily semimartingales. Roughly speaking, given the closure…

Probability · Mathematics 2007-05-23 K. Ramanan

The de-facto standard approach of promoting sparsity by means of $\ell_1$-regularization becomes ineffective in the presence of simplex constraints, i.e.,~the target is known to have non-negative entries summing up to a given constant. The…

Methodology · Statistics 2016-05-04 Ping Li , Syama Sundar Rangapuram , Martin Slawski

Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…

Machine Learning · Computer Science 2024-01-24 Alexandre d'Aspremont , Cristóbal Guzmán , Clément Lezane

We present a technique for the approximation of a class of Hilbert space-valued maps which arise within the framework of Model Order Reduction for parametric partial differential equations, whose solution map has a meromorphic structure.…

Numerical Analysis · Mathematics 2021-02-19 Davide Pradovera

This work deals with a regularization method enforcing solution sparsity of linear ill-posed problems by appropriate discretization in the image space. Namely, we formulate the so called least error method in an $\ell^1$ setting and perform…

Numerical Analysis · Mathematics 2016-08-03 Kristian Bredies , Barbara Kaltenbacher , Elena Resmerita

We study Sinkhorn's algorithm for solving the entropically regularized optimal transport problem. Its iterate $\pi_{t}$ is shown to satisfy $H(\pi_{t}|\pi_{*})+H(\pi_{*}|\pi_{t})=O(t^{-1})$ where $H$ denotes relative entropy and $\pi_{*}$…

Optimization and Control · Mathematics 2025-04-08 Promit Ghosal , Marcel Nutz