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

Trend · papers per month

3672107143 · May 202619922001200920172026
48 results for Le Cam's equation

A new framework for robust transfer learning that avoids negative transfer in domains with unequal information.

problem Negative transfer in unsupervised domain adaptation, especially when source and target domains have different levels of informativeness.
method Decision-theoretic framework based on Le Cam's theory of statistical experiments, using constructive approximations to replace strict invariance with directional simulability.
result Le Cam Distortion achieves near-perfect frequency estimation and zero source utility loss in various domains, demonstrating superior performance compared to traditional methods.

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.

The paper extends statistical estimation techniques under differential privacy.

problem Establishing sample complexity bounds for estimation tasks under differential privacy.
method Proposes analogues of Le Cam's method, Fano's inequality, and Assouad's lemma under central differential privacy.
result Optimal sample complexity bounds for discrete distribution estimation under total variation and 2\ell_2 distances.

Stochastic approximation proves asymptotic normality for non-smooth problems.

problem Solving non-smooth stochastic approximation problems.
method Stochastic approximation algorithms for solving smooth equations, extended to non-smooth problems.
result Asymptotic normality and optimality in non-smooth stochastic approximation is proven.

Paper introduces robust deep learning method for handling random data corruption.

problem Random corruption in deep learning data due to limited quality of data.
method Inspired by median-of-means and Le Cam's principle, introduces a new approach.
result Demonstrates the approach performs well in practice and is a promising alternative to standard training methods.

This paper studies a class of exponential family models whose canonical parameters are specified as linear functionals of an unknown infinite-dimensional slope function. The optimal minimax rates of convergence for slope function estimation are established. The estimators that achieve the optimal rates are constructed …

2011-08-17abs ↗pdf ↗

"Deep Learning" methods attempt to learn generic features in an unsupervised fashion from a large unlabelled data set. These generic features should perform as well as the best hand crafted features for any learning problem that makes use of this data. We provide a definition of generic features, characterize when it i…

2014-02-20abs ↗pdf ↗

Unified framework for lower bounds in interactive decision making.

problem Challenges in interactive decision making, especially bandits and reinforcement learning.
method Interactive Fano method and Fractional Covering Number.
result Unified characterization of learnability for stochastic bandit problems and tight lower bounds for interactive decision making.

Stochastic algo learns from evolving data, achieving optimal performance.

problem Performative prediction and multiplayer extensions.
method Stochastic approximation with decision-dependent distributions.
result Asymptotic normality and optimality of the algorithm's performance.

To better understand the interplay of censoring and sparsity we develop finite sample properties of nonparametric Cox proportional hazard's model. Due to high impact of sequencing data, carrying genetic information of each individual, we work with over-parametrized problem and propose general class of group penalties s…

2012-07-18abs ↗pdf ↗

The study examines conditions for achieving a simple lower bound in estimating mean from samples.

problem Achieving a simple lower bound for estimating the mean of a distribution.
method Analyzes conditions for nearly attaining Le Cam's two-point testing lower bound for mean estimation.
result An algorithm nearly attains the two-point testing rate for mixtures of symmetric, log-concave distributions with a common mean.

LDP is equivalent to contraction of E_γ-divergence, impacting privacy and utility.

problem Analyzing trade-offs between privacy and utility in estimation problems.
method Equivalence of LDP constraints to contraction coefficients of E_γ-divergence, using f-divergences and estimation-theoretic tools.
result LDP guarantees can be expressed in terms of contraction coefficients of arbitrary f-divergences.

Often, high dimensional data lie close to a low-dimensional submanifold and it is of interest to understand the geometry of these submanifolds. The homology groups of a manifold are important topological invariants that provide an algebraic summary of the manifold. These groups contain rich topological information, for…

2011-12-23abs ↗pdf ↗

We study local complexity measures for stochastic convex optimization problems, providing a local minimax theory analogous to that of Hájek and Le Cam for classical statistical problems. We give complementary optimality results, developing fully online methods that adaptively achieve optimal convergence guarantees. Our…

2016-12-16abs ↗pdf ↗

We propose a technique for making Convolutional Neural Network (CNN)-based models more transparent by visualizing input regions that are 'important' for predictions -- or visual explanations. Our approach, called Gradient-weighted Class Activation Mapping (Grad-CAM), uses class-specific gradient information to localize…

2016-11-22abs ↗pdf ↗

Enhanced visibility forecasts using CAMS data improve accuracy.

problem Improving the accuracy of visibility predictions in weather forecasts.
method Statistical post-processing with historical observations and CAMS forecasts.
result Post-processed forecasts with CAMS data are substantially superior to raw and climatological predictions.

We present a new short proof of the explicit formula for the group of links (and also link maps) in the 'quadruple point free' dimension. Denote by Lp,qmL^m_{p,q} (respectively, CpmpC^{m-p}_p) the group of smooth embeddings SpSqSmS^p\sqcup S^q\to S^m (respectively, SpSmS^p\to S^m) up to smooth isotopy. Denote by LMp,qmLM^m_{p,q} the …

2006-10-10abs ↗pdf ↗

The homology groups of a manifold are important topological invariants that provide an algebraic summary of the manifold. These groups contain rich topological information, for instance, about the connected components, holes, tunnels and sometimes the dimension of the manifold. In earlier work, we have considered the s…

2013-07-29abs ↗pdf ↗

Nous montrons que les équations du repère mobile des surfaces de Bonnet conduisent à une paire de Lax matricielle isomonodromique d'ordre deux pour la sixième équation de Painlevé. We show that the moving frame equations of Bonnet surfaces can be extrapolated to a second order, isomonodromic matrix Lax pair of the sixt…

2016-07-05abs ↗pdf ↗

New proof for rotationally symmetric gradient Ricci solitons in 2-4 dimensions.

problem Existence of rotationally symmetric gradient Ricci solitons in specific dimensions.
method Analytical proof using differential equations.
result Existence and uniqueness of solutions for the given equations.

Let (M,g(t))(M,g(t)), 0tT0\le t\le T, be a n-dimensional complete noncompact manifold, n2n\ge 2, with bounded curvatures and metric g(t)g(t) evolving by the Ricci flow gijt=2Rij\frac{\partial g_{ij}}{\partial t}=-2R_{ij}. We will extend the result of L. Ma and Y. Yang and prove a local gradient estimate for positive solutions of the n…

2008-06-25abs ↗pdf ↗

Differential privacy formalises privacy-preserving mechanisms that provide access to a database. We pose the question of whether Bayesian inference itself can be used directly to provide private access to data, with no modification. The answer is affirmative: under certain conditions on the prior, sampling from the pos…

2013-06-05abs ↗pdf ↗

Compactness of metrics with higher-order constant Q-curvature on manifolds.

problem Investigating compactness of conformal metrics with constant QQ-curvature of higher order.
method Analyzing solutions of the QQ-curvature equation using Juhl's recursive formulae and blow-up analysis.
result Established compactness for an arbitrary 1k<n21 \le k < \frac{n}{2} under specific conditions.

VRPG algorithm optimizes convex constraints with non-asymptotic guarantees.

problem Stochastic convex optimization under convex constraints.
method Natural variance reduced proximal gradient (VRPG) algorithm.
result VRPG achieves local minimax lower bound up to constants and log factor of NN.

Let (M,g(t))(M,g(t)), 0tT0\le t\le T, Mφ\partial M\neφ, be a compact nn-dimensional manifold, n2n\ge 2, with metric g(t)g(t) evolving by the Ricci flow such that the second fundamental form of M\partial M with respect to the unit outward normal of M\partial M is uniformly bounded below on M×[0,T]\partial M\times [0,T]. We will pr…

2008-01-23abs ↗pdf ↗

Extends causal additive models to include higher-order interactions.

problem Inferring causal insights from data with higher-order mechanisms.
method Introduces directed acyclic hypergraphs to represent higher-order interactions in causal structure learning.
result Learning more complex hypergraphs can lead to better empirical results.

This paper deals with finding an nn-dimensional solution xx to a system of quadratic equations of the form yi=ai,x2y_i=|\langle{a}_i,x\rangle|^2 for 1im1\le i \le m, which is also known as phase retrieval and is NP-hard in general. We put forth a novel procedure for minimizing the amplitude-based least-squares empirical los…

2017-05-29abs ↗pdf ↗

We study the asymptotic Dirichlet problem for the minimal graph equation on a Cartan-Hadamard manifold MM whose radial sectional curvatures outside a compact set satisfy an upper bound K(P)φ(φ1)r(x)2K(P)\le - \frac{φ(φ-1)}{r(x)^2} and a pointwise pinching condition K(P)CKK(P)|K(P)|\le C_K|K(P')| for some constants φ>1φ>1 and $C_K\ge 1…

2015-04-21abs ↗pdf ↗

New findings on Helmholtz equation solutions show exponential growth in constant for three ball inequality.

problem Analyzing solutions of Helmholtz equation on different manifolds.
method Examining the three ball inequality for solutions of Helmholtz equation on Rn\mathbb{R}^n, Sn\mathbb{S}^n, or Hn\mathbb{H}^n.
result The constant in the three ball inequality grows exponentially with the wave number.

Develops high-probability minimax quantile bounds for statistical problems.

problem Statistical procedures often lose information about tail behavior when reduced to expectations.
method Introduces minimax quantiles, develops high-probability variants of minimax methods, and converts risk lower bounds to quantile lower bounds.
result Obtains high-probability minimax quantile lower bounds for various statistical problems.

Study on blow-up behavior of sign-changing solutions for Yamabe equation.

problem Blow-up behavior of sign-changing solutions for Yamabe equation.
method Construction of a smooth metric on space forms to prove blow-up at lowest energy level.
result Blow-up occurs at the lowest energy level for sign-changing solutions in dimensions 11 to 24.

Deep neural features identify unique vehicles from dash-cam feeds.

problem Identifying unique vehicles in dash-cam feeds for self-driving cars.
method Used pretrained YOLO network feature maps to create deep integrated feature signatures (DIFS) for 700 images of 35 vehicles and 340 images of 17 vehicles.
result Correctly identified unique vehicles at 96.7% for high resolution data and 86.8% for lower resolution data.

Paper proposes methods to discover causal models with unobserved variables.

problem Discovering causal relationships in data with unobserved variables.
method Two methods leveraging prior knowledge for causal discovery in CAM-UV models.
result Accuracy of causal discovery improves with more prior knowledge.

The paper analyzes McKean-Vlasov equations with hitting times, proving global solvability.

problem Analyzing blow-ups in McKean-Vlasov equations involving hitting times.
method Connection to the supercooled Stefan problem, comparison principles, and new transform.
result Proves global solvability for McKean-Vlasov dynamics under certain conditions.

Let n>2, 0<m(n2)/n0<m\le (n-2)/n, p>\max(1,(1-m)n/2), and 0u0Llocp(Rn)0\le u_0\in L_{loc}^p(R^n) satisfy lim infRRn+21mxRu0dx=\liminf_{R\to\infty}R^{-n+\frac{2}{1-m}}\int_{|x|\le R}u_0\,dx=\infty. We prove the existence of unique global classical solution of ut=n1mΔumu_t=\frac{n-1}{m}Δu^m, u>0, in Rn×(0,)R^n\times (0,\infty), u(x,0)=u_0(x) in Rn\R^n. If in addition …

2011-09-16abs ↗pdf ↗