Research
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,657 papers · 148 categories

Trend · papers per month

147294440587 · Jun 202019922001200920172026
48 results for convex density classes

Study exact minimax rates for density estimation over convex classes, extending previous work.

problem Deriving minimax rates for density estimation over convex density classes.
method Building on Le Cam's work, determine exact minimax rates using local metric entropy.
result Exact minimax rates derived for any convex density class, including nonparametric and parametric cases.

Geodesic balls are isoperimetric in hyperbolic spaces with certain densities.

problem Proving isoperimetric properties in hyperbolic spaces with specific densities.
method Using geodesic balls and radial, strictly log-convex densities.
result Geodesic balls are isoperimetric in real hyperbolic space HRnH_{\mathbb R}^n.

The paper proves new inequalities in hyperbolic space using Euclidean methods.

problem Proving weighted isoperimetric inequalities in hyperbolic space.
method Using isoperimetric inequality with log-convex density in Euclidean space.
result Removed horo-convex assumption and proved new inequalities for star-shaped domains.

We construct an infinite-dimensional information manifold based on exponential Orlicz spaces without using the notion of exponential convergence. We then show that convex mixtures of probability densities lie on the same connected component of this manifold, and characterize the class of densities for which this mixtur…

2001-04-23abs ↗pdf ↗

We completely characterize isoperimetric regions in R^n with density e^h, where h is convex, smooth, and radially symmetric. In particular, balls around the origin constitute isoperimetric regions of any given volume, proving the Log-Convex Density Conjecture due to Kenneth Brakke.

2013-11-16abs ↗pdf ↗

Paper proposes a new method for density estimation using squared Hellinger distance.

problem Density estimation using moment methods is sensitive to the choice of functions.
method Proposes a non-classical parametrization using squared Hellinger distance for density estimation.
result The proposed method does not require choosing functions and can be solved by convex optimization.

Solves a general class of free boundary Monge-Ampère equations.

problem Optimal transport with degenerate densities and geometric problems.
method Analyzes a specific class of Monge-Ampère equations and their applications.
result Solves the equations for a general class, including applications to optimal transport and geometric problems.

We consider the problem of sampling from a density of the form p(x)exp(f(x)g(x))p(x) \propto \exp(-f(x)- g(x)), where f:RdRf: \mathbb{R}^d \rightarrow \mathbb{R} is a smooth and strongly convex function and g:RdRg: \mathbb{R}^d \rightarrow \mathbb{R} is a convex and Lipschitz function. We propose a new algorithm based on the Metropolis-Has…

2019-10-01abs ↗pdf ↗

Dual-ISL improves implicit generative model training with convex optimization and explicit density approximation.

problem Training implicit generative models with robust and practical likelihood-free objectives.
method Introduces dual-ISL, a novel likelihood-free objective using a convex divergence derived from the invariant statistical loss (ISL) framework.
result Dual-ISL yields a convex optimization problem in the space of model densities, providing explicit density approximation and improved training stability.

New method recovers clusters in non-convex finite metric spaces with oracle queries.

problem Exact recovery of clusters in non-convex finite metric spaces.
method Introducing (β,γ)(β,γ)-convexity and a deterministic algorithm using oracle queries.
result Clusters can be recovered using O(k2logn+k2(6/βγ)dens(X))O(k^2 \log n + k^2 (6/βγ)^{dens(X)}) same-cluster queries.

The paper studies geometric properties of hydrodynamical density manifolds.

problem Understanding the geometry of hydrodynamical density manifolds.
method Formulating connections, gradients, Hessians, parallel transports, and curvatures on these manifolds.
result Closed-form formulas for sectional curvatures in one-dimensional density manifolds.

Study minimax risk of score estimation for log-concave distributions.

problem Minimizing risk in score estimation for log-concave distributions.
method Developed subclasses of log-concave densities and constructed a locally adaptive, multiscale estimator.
result Established minimax rates for score estimation over specific subclasses of log-concave densities.

We study the isoperimetric problem for Euclidean space endowed with a continuous density. In dimension one, we characterize isoperimetric regions for a unimodal density. In higher dimensions, we prove existence results and we derive stability conditions, which lead to the conjecture that for a radial log-convex density…

2006-02-07abs ↗pdf ↗

Optimum in Convex Hulls (OCH) generalizes clinical trial results to broader populations.

problem Clinical trials exclude confounding but limit recruitment; observational data are more inclusive but suffer from confounding.
method OCH uses convex hulls of conditional expectations or densities to approximate the true treatment effect from both observational and trial data.
result OCH estimates the treatment effect with state-of-the-art accuracy in terms of both expectations and densities.

Optimal scaling for proximal MALA in high dimensions confirmed.

problem Optimizing sampling efficiency in high-dimensional target densities.
method Introduced and analyzed the proximal MALA algorithm, showing it maintains optimal scaling.
result Proximal MALA achieves optimal scaling in high dimensions with an average acceptance probability of 0.574.

For an infinite cardinal κκ let 2(κ)\ell_2(κ) be the linear hull of the standard othonormal base of the Hilbert space 2(κ)\ell_2(κ) of density κκ. We prove that a non-separable convex subset XX of density κκ in a locally convex linear metric space if homeomorphic to the space (i) 2f(κ)\ell_2^f(κ) if and only if XX can be…

2013-05-07abs ↗pdf ↗

Study on regularity of optimal transport maps on convex domains with quadratic cost.

problem Regularity of optimal transport maps between convex domains with quadratic cost.
method Analysis of CαC^α-densities and C1,αC^{1, α} boundary conditions, monotonicity formula for optimal transport maps.
result Proves C1,1εC^{1, 1-\varepsilon}-regularity for nondegenerate CαC^α-densities and C2,αC^{2, α}-regularity for C1,αC^{1, α} boundary.

We prove some old and new isoperimetric inequalities with the best constant using the ABP method applied to an appropriate linear Neumann problem. More precisely, we obtain a new family of sharp isoperimetric inequalities with weights (also called densities) in open convex cones of Rn\mathbb{R}^n. Our result applies to…

2013-04-05abs ↗pdf ↗

The paper tackles MAP inference over non-convex constraints in safety-critical settings.

problem Efficiently computing MAP predictions subject to non-convex constraints is challenging.
method The paper investigates conditions for exact and efficient MAP inference over continuous variables and devises scalable algorithms for both tractable and general cases.
result The proposed methods outperform constraint-agnostic baselines and scale to complex densities.

The classic double bubble theorem says that the least-perimeter way to enclose and separate two prescribed volumes in RN\mathbb{R}^N is the standard double bubble. We seek the optimal double bubble in RN\mathbb{R}^N with density, which we assume to be strictly log-convex. For N=1N=1 we show that the solution is sometime…

2017-08-10abs ↗pdf ↗

An image pattern can be represented by a probability distribution whose density is concentrated on different low-dimensional subspaces in the high-dimensional image space. Such probability densities have an astronomical number of local modes corresponding to typical pattern appearances. Related groups of modes can join…

2018-03-02abs ↗pdf ↗

New method estimates density ratio for well-separated distributions using multi-class logistic regression.

problem Challenges in estimating density ratio for well-separated distributions.
method Uses multi-class logistic regression with auxiliary densities to estimate log(p/q).
result Demonstrates superior performance on density ratio estimation, mutual information, and representation learning tasks.

Unified framework for OOD detection using class ratio estimation.

problem Density-based OOD detection is unreliable for OOD images.
method Unified framework that builds energy-based models and employs differing base distributions, directly estimating the density ratio through class ratio estimation.
result Competitive results on OOD image problems compared to recent work.

The paper explores optimal regularizers for data sources, linking them to star bodies.

problem Understanding optimal regularizers for data sources.
method Investigates optimal regularizers for data distributions using star bodies and dual Brunn-Minkowski theory.
result Identifies optimal regularizers and assesses amenability to convex regularization.

The paper corrects the use of the transverse density bundle in Lie groupoids.

problem Incorrect use of the transverse density bundle in Lie groupoids.
method Revisiting and clarifying the concepts of transverse density bundle and modular classes.
result The transverse density bundle should be used instead of the common representation QAQ_A.

Let Sm{\mathcal S}_m be the set of all m×mm\times m density matrices (Hermitian positively semi-definite matrices of unit trace). Consider a problem of estimation of an unknown density matrix ρSmρ\in {\mathcal S}_m based on outcomes of nn measurements of observables X1,,XnHmX_1,\dots, X_n\in {\mathbb H}_m (Hm{\mathbb H}_m bei…

2016-04-15abs ↗pdf ↗

We introduce a new volume definition on normed vector spaces. We show that the induced kk-area functionals are convex for all kk. In the particular case k=2k=2, our theorem implies that Busemann's 2-volume density is convex, which was recently shown by Burago-Ivanov. We also show how the new volume definition is relat…

2013-05-07abs ↗pdf ↗

In this work, we propose new objective functions to train deep neural network based density ratio estimators and apply it to a change point detection problem. Existing methods use linear combinations of kernels to approximate the density ratio function by solving a convex constrained minimization problem. Approximating…

2019-05-23abs ↗pdf ↗