A function is exponentially concave if its exponential is concave. We consider exponentially concave functions on the unit simplex. In a previous paper we showed that gradient maps of exponentially concave functions provide solutions to a Monge-Kantorovich optimal transport problem and give a better gradient approximat…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “exponentially concave”
Gradient methods converge exponentially in concave network games.
problem Finding Nash equilibria in concave network zero-sum games.
method Gradient Ascent and Optimistic Gradient Ascent analyses.
result Exponential convergence rates in various game settings.
In this paper, we present a simple analysis of {\bf fast rates} with {\it high probability} of {\bf empirical minimization} for {\it stochastic composite optimization} over a finite-dimensional bounded convex set with exponential concave loss functions and an arbitrary convex regularization. To the best of our knowledg…
RHMC accelerates sampling from log-concave distributions.
problem Sampling from log-concave probability distributions efficiently.
method RHMC uses simulated Hamiltonian dynamics with random integration times.
result RHMC converges exponentially fast in KL divergence for log-concave distributions.
The paper extends mixability theory to function-valued forecasts, proving various loss functions are mixable.
problem Efficient aggregation of functional and probabilistic forecasts in online prediction games.
method Adapting mixable and exponentially concave loss functions to function-valued forecasts.
result Various loss functions used for probabilistic forecasting are mixable (exp-concave).
New bounds for generative models under weaker assumptions.
problem Establishing convergence guarantees for generative models under weak assumptions.
method Non-asymptotic 2-Wasserstein distance bounds for probability flow ODEs under weak log-concavity and Lipschitz continuity.
result Concrete convergence rates for generative models, including non-log-concave distributions.
The paper studies randomized approximations of Tukey's depth for log-concave isotropic data.
problem The challenge of approximating Tukey's depth in high dimensions.
method The study examines randomized algorithms for approximating Tukey's depth for log-concave isotropic data.
result Randomized algorithms correctly approximate maximal depth and close to zero depths but not intermediate depths.
New stability bounds for Sinkhorn's algorithm in entropic optimal transport.
problem Stability and convergence of Sinkhorn's algorithm for entropic optimal transport.
method Semiconcavity approach to analyze stability and convergence.
result Exponential convergence of Sinkhorn's algorithm under semiconcavity conditions.
We study the problem of sampling from a distribution $\target$ using the Langevin Monte Carlo algorithm and provide rate of convergences for this algorithm in terms of Wasserstein distance of order . Our result holds as long as the continuous diffusion process associated with the algorithm converges exponentially fa…
We consider curvature flows in hyperbolic space with a monotone, symmetric, homogeneous of degree 1 curvature function F. Furthermore we assume F to be either concave and inverse concave or convex. For compact initial hypersurfaces, which are strictly convex by horospheres, we show the long time existence of mixed volu…
Improved sampling for diffusion models and log-concave distributions.
problem Efficient sampling for diffusion models and log-concave distributions.
method Algorithms for sampling with -error in steps using accurate score estimates.
result Exponential improvement in complexity over previous results.
Improved KLMC for sampling under various conditions.
problem Stable simulation of kinetic Langevin dynamics under different parameters.
method Revisited synchronous Wasserstein coupling analysis with stochastic exponential Euler discretization.
result Exponential integrator can simulate kinetic Langevin dynamics in the overdamped regime with proper time acceleration.
Estimates log-concave densities in graphical models using tent functions.
problem Maximum likelihood estimation of log-concave densities in undirected graphs.
method MLE as product of tent functions corresponding to maximal cliques.
result MLE can be found via convex optimization.
A new model predicts price concavity and reversion after metaorder execution.
problem Modeling market response to exogenous trades on limit order books.
method Developed a Non-Markovian Zero Intelligence model with a time-weighted mid-price return function.
result The model predicts concave price paths and price reversion after metaorder execution.
Paper provides exponential convergence guarantees for Iterative Markovian Fitting.
problem Addressing the Schrödinger Bridge problem in computational optimal transport and generative modeling.
method Develops non-asymptotic exponential convergence guarantees for Iterative Markovian Fitting.
result First non-asymptotic exponential convergence guarantees for IMF under mild structural assumptions.
Gibbs sampler contracts entropy under strong log-concavity, improving mixing time.
problem Improving the mixing time of Gibbs sampler under strong log-concavity.
method Analyzing Gibbs sampler contraction under strong log-concavity, providing sharp contraction rate.
result Gibbs sampler contracts entropy linearly with condition number and independent of dimension under strong log-concavity.
CAVI converges for log-concave measures via optimal transport.
problem Finding the closest product measure to a log-concave measure via CAVI.
method Adapting coordinate descent techniques from Euclidean space to optimal transport for log-concave densities.
result Proves convergence of CAVI for log-concave densities and provides rates of convergence under additional conditions.
The overarching goal of this paper is to derive excess risk bounds for learning from exp-concave loss functions in passive and sequential learning settings. Exp-concave loss functions encompass several fundamental problems in machine learning such as squared loss in linear regression, logistic loss in classification, a…
High-dimensional data analysis has motivated a spectrum of regularization methods for variable selection and sparse modeling, with two popular classes of convex ones and concave ones. A long debate has been on whether one class dominates the other, an important question both in theory and to practitioners. In this pape…
Optimizes algorithms for non-concave bandit problems.
problem Optimizing algorithms for non-concave bandit problems.
method Unified zeroth-order optimization paradigm.
result Minimax-optimal algorithms in the dimension for low-rank generalized linear bandit problems.
The paper proves convergence of certain curvature flows to the origin.
problem Analyzing the convergence of specific curvature flows in Euclidean space.
method Examining fully nonlinear contracting curvature flows with given normal speeds.
result The flows converge exponentially to a sphere centered at the origin after rescaling.
Strict concavity proven for growth indicator function of certain groups.
problem Proving strict concavity of growth indicator function for specific groups.
method Smoothness of Manhattan hypersurface and critical-exponent map.
result Strict concavity of growth indicator function for relatively Anosov groups.
Optimal trading strategy under market resistance and concave price impact model.
problem Optimal trading in a market with endogenous resistance and concave price impact.
method Modeling market resistance, deriving a stochastic Fredholm equation, proving existence and uniqueness, proposing an iterative scheme.
result Existence and uniqueness of optimal control under certain conditions, exponential convergence of iterative scheme.
A new algorithm reduces online exp-concave optimization runtime.
problem Minimizing regret in online learning with exponentially concave losses.
method LightONS, a variant of Online Newton Step (ONS), reduces runtime to .
result Optimal regret with reduced runtime to .
Develops a new method for optimizing portfolios in stochastic markets.
problem Optimizing functionally generated portfolios in stochastic portfolio theory.
method Optimizes over a family of rank-based portfolios parameterized by an exponentially concave function.
result Proves existence and uniqueness of the optimization problem and provides stability estimates.
The article extends previous work on contracting convex hypersurfaces by nonhomogeneous curvature functions.
problem Contraction of convex hypersurfaces by nonhomogeneous functions of curvature.
method Extending previous results to various cases, showing convergence to asymptotically round points under pinching conditions.
result Convergence to asymptotically round points under suitable rescaling and pinching conditions.
New method uses weighted SDEs to improve sampling from complex distributions.
problem Sampling from highly non-log-concave distributions.
method Introduces weighted stochastic differential equations to augment diffusion-based samplers.
result Demonstrates improved exploration of nonconvex or multimodal landscapes.
We provide new results concerning label efficient, polynomial time, passive and active learning of linear separators. We prove that active learning provides an exponential improvement over PAC (passive) learning of homogeneous linear separators under nearly log-concave distributions. Building on this, we provide a comp…
Sampling from Constrained Gibbs Measures: with Applications to High-Dimensional Bayesian Inferencemath.ST
The paper tackles sampling from Gibbs measures with constrained support, providing a sampling guarantee.
problem Sampling from Gibbs measures with constrained support, especially in the pre-asymptotic regime.
method Analyzing the spectral gap of Langevin dynamics to provide a non-asymptotic sampling guarantee.
result The low-temperature Gibbs distribution concentrates on a neighborhood of its mode in the pre-asymptotic regime.
Study on critical Lagrangian phase singularities in mean curvature flow.
problem Analyzing singularities in the Lagrangian mean curvature flow at the critical phase.
method Developed new method to prove estimates by using concave operators.
result Established interior estimates for critical Lagrangian phase singularities.
New method for modeling densities on Riemannian manifolds with symmetries.
problem Modeling densities on Riemannian manifolds with known symmetry groups.
method Combining implicit neural layers and optimal transport theory to propose IRCPMs.
result IRCPMs are simpler to incorporate symmetries and less expensive than ODE-flows.
Investigates probability of error in structured thresholding bandit problems.
problem Probability of misclassifying arms in structured thresholding bandit problems.
method Analyzes two shape constraints: monotonic increasing and concave sequences of arm means.
result Upper and lower bounds for the probability of error match up to constants in the problem dependent regime.
The paper studies price impacts in asset liquidation markets.
problem Understanding price impacts in asset liquidation markets.
method Equilibrium formulation and analysis of price impacts.
result Existence and uniqueness of clearing prices for portfolio liquidation.
Improved regret bounds for adversarial linear contextual bandits.
problem Adversarial linear contextual bandits with changing loss functions.
method Truncated continuous exponential weights algorithm over the probability simplex, analyzing with linear bandit setting without contexts.
result Second-order bound of and first-order bound of .
We consider the problem of sampling from a strongly log-concave density in , and prove a non-asymptotic upper bound on the mixing time of the Metropolis-adjusted Langevin algorithm (MALA). The method draws samples by simulating a Markov chain obtained from the discretization of an appropriate Langevin dif…
Algorithm learns halfspaces in noisy data efficiently.
problem Learning halfspaces with Tsybakov noise.
method Novel semi-definite programming and online convex optimization.
result First non-trivial PAC learning algorithm for Tsybakov noise.
This paper studies the optimal risk-averse timing to sell a risky asset. The investor's risk preference is described by the exponential, power, or log utility. Two stochastic models are considered for the asset price -- the geometric Brownian motion and exponential Ornstein-Uhlenbeck models -- to account for, respectiv…
New sampling algorithm for non-log-concave distributions requires many queries.
problem Sampling from non-log-concave distributions with good accuracy.
method Lower bound on query complexity and algorithm for sampling.
result Tight query complexity characterization for sampling from non-log-concave distributions.
The study bounds the utility of empirically optimal portfolios using stock return data.
problem Maximizing expected ratio of portfolio utility to best asset utility.
method High probability utility bounds derived from Lipschitz or Hölder continuous utility functions.
result Utility bounds depend on utility function, number of assets, and observations.
Finite Sample Complexity of Sequential Monte Carlo Estimators on Multimodal Target Distributionsstat.CO
New bounds for SMC show its advantage over MCMC in multimodal distributions.
problem Estimating expectations under multimodal distributions with slow global mixing.
method Proves finite sample complexities for SMC with local mixing times, addressing bias through sequential resampling.
result SMC provides fully polynomial time approximation for multimodal problems.
The paper establishes conditions for strict power concavity in convolutions.
problem Conditions for strict power concavity in convolutions.
method Analyzes sufficient conditions for strict parabolic power concavity of convolutions.
result Establishes sufficient conditions for strict power concavity of convolutions.
Enhances LMC for log-concave sampling, reducing computational cost.
problem High computational cost of LMC for high-dimensional problems.
method Random coordinate descent (RCD) combined with variance reduction techniques (SAGA, SVRG).
result Achieves computational cost reduction compared to classical LMC, same number of iterations as LMC.
New algorithm speeds up sampling from complex Bayesian mixture models.
problem Sampling from non-log-concave, multi-modal posterior distributions in Bayesian Gaussian mixtures.
method Introduced Reflected Metropolis-Hastings Random Walk (RMRW) algorithm.
result Proved mixing time bound for RMRW in symmetric two-component Gaussian mixtures.
We consider the quermassintegral preserving flow of closed \emph{h-convex} hypersurfaces in hyperbolic space with the speed given by any positive power of a smooth symmetric, strictly increasing, and homogeneous of degree one function of the principal curvatures which is inverse concave and has dual approachi…
Minimal graph level sets are concave if boundary is concave.
problem Understanding curvature of minimal graph level sets.
method Proved an inequality and showed geometric properties.
result Level sets of minimal graphs are concave if boundary is concave.
We propose a computationally efficient random walk on a convex body which rapidly mixes and closely tracks a time-varying log-concave distribution. We develop general theoretical guarantees on the required number of steps; this number can be calculated on the fly according to the distance from and the shape of the next…
Prompted by a recent experiment by Victor Haghani and Richard Dewey, this note generalises the Kelly strategy (optimal for simple investment games with log utility) to a large class of practical utility functions and including the effect of extraneous wealth. A counterintuitive result is proved : for any continuous, co…
Simple connection between Harnack inequalities and concavity of arrival time functions.
problem Proving differential Harnack inequalities for various flows.
method Directly proving concavity properties of time-of-arrival functions for a class of flows using a concavity maximum principle.
result Short proof of Hamilton's and Andrews' differential Harnack inequalities.