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

Trend · papers per month

172343515686 · Jun 202019922001200920172026
48 results for smoothing distribution

Smooth distributions on subcartesian spaces can be globally finitely generated.

problem Understanding smooth distributions on subcartesian spaces.
method Embedding in Euclidean space, Whitney Embedding Theorem, and distribution theory.
result Smooth generalized distributions and subbundles on connected subcartesian spaces are globally finitely generated.

A subbundle of variable dimension inside the tangent bundle of a smooth manifold is called a smooth distribution if it is the pointwise span of a family of smooth vector fields. We prove that all such distributions are finitely generated, meaning that the family may be taken to be a finite collection. Further, we show …

2010-12-27abs ↗pdf ↗

We show that any generalised smooth distribution on a smooth manifold, possibly of non-constant rank, admits a Riemannian metric. Using such a metric, we attach a Laplace operator to any smooth distribution as such. When the underlying manifold is compact, we show that it is essentially self-adjoint. Viewing this Lapla…

2018-07-18abs ↗pdf ↗

This work investigates the properties of Gaussian-smoothed sliced divergences for comparing distributions.

problem Comparing probability distributions while preserving privacy.
method Investigates the theoretical properties of Gaussian-smoothed sliced Wasserstein distance and generalized versions.
result Gaussian smoothed sliced Wasserstein distance converges with a rate of \(O(n^{-1/2})\).

In this paper we continue the study of spectral properties of Laplacians associated with an arbitrary smooth distribution on a compact manifold, initiated in a previous paper. Under assumption that the singular foliation generated by the distribution is smooth, we prove that the Laplacian associated with the distributi…

2017-10-27abs ↗pdf ↗

SIXO improves inference by learning smoothing distributions from all observations.

problem Inference limitations due to ignoring future observations in filtering distributions.
method Density ratio estimation to warp filtering distributions into smoothing distributions, then use SMC with learned targets.
result Proves tighter log marginal lower bounds and more accurate inferences and estimates.

Efficient EP algorithm improves smoothing distribution inference in financial models.

problem Computational intractability of smoothing distribution in high dimensions.
method Adapted expectation propagation (EP) algorithms for the unified skew-normal family.
result Accuracy gains in financial illustrations over existing approximate algorithms.

New algorithm for differentially private distributed optimization of smooth, non-convex problems.

problem No differentially private distributed method for smooth, non-convex optimization problems.
method Smoothed normalization integrated with an error-feedback mechanism.
result Achieves superior convergence rate and first differentially private distributed optimization algorithm with provable convergence guarantees.

This paper extends exponential smoothing to distributional time series using Wasserstein distance.

problem Forecasting distributional time series with exponential smoothing.
method Generalized exponential smoothing in Wasserstein space, with consistent parameter estimation.
result Wasserstein exponential smoothing outperforms traditional methods in high-frequency financial and electricity demand data.

We study diffeologies on locally convex spaces and their application to smooth multiplication of distributions.

problem Constructing smooth multiplication of distributions on locally convex spaces.
method Using diffeological colimits and wavefront-set criterion.
result Proving smooth multiplication of microlocally multipliable distributions.

New method improves robustness of smoothed classifiers against adversarial attacks.

problem Improving robustness of smoothed classifiers against adversarial attacks.
method Proposes worst-case adversarial loss over input distributions as a robustness certificate, and uses duality and smoothness properties to provide an easy-to-compute upper bound.
result Shows superior robustness performance over state-of-the-art certified or heuristic methods.

LSAM optimizes deep learning training with improved efficiency.

problem Inefficiency in distributed large-batch training with Sharpness-Aware Minimization (SAM).
method Integrates SAM's adversarial steps with an asynchronous distributed sampling strategy.
result Higher final accuracy compared to data-parallel SAM.

New method improves counterfactual distribution learning for high-dimensional outcomes.

problem Counterfactual distribution learning for high-dimensional outcomes with concentrated structure.
method Geometry-adaptive diffusion-guided smoothing estimators combining causal nuisance adjustment and local outcome geometry.
result Geometry-adaptive methods show steeper error decay in semi-synthetic experiments.

Study on diffeologies on locally convex spaces and smooth multiplication of distributions.

problem Geometric characterization and smoothness of distribution multiplication.
method Investigation of canonical and cc^\infty-diffeologies on locally convex spaces, proving geometric characterizations, and comparing diffeologies.
result Established a framework for nonlinear distribution theory beyond manifolds, realizing microlocally multipliable distributions as a diffeological colimit.

Whereas subriemannian geometry usually deals with smooth horizontal distributions, partially hyperbolic dynamical systems provide many examples of subriemannian geometries defined by non-smooth (namely, Hölder continuous) distributions. These distributions are of great significance for the behavior of the parent dynami…

2007-09-25abs ↗pdf ↗

Proves Sard conjecture for specific distributions, controlling divergence of vector fields.

problem Proving the Sard conjecture for certain types of distributions.
method Constructs a singular distribution capturing essential abnormal lifts, proving the conjecture for rank 3 distributions in dimension 4 and generic corank 1 distributions.
result Proves the Sard conjecture for generic co-rank one distributions.

New insights into learning from distributional adversaries and private data.

problem Understanding minimal assumptions for learning and generalization under distributional constraints.
method Generalized smoothness as a characterization of learnability and privacy under distributional adversaries.
result Near complete characterization of families that admit learnability and privacy under distributional adversaries.

The paper improves smoothed analysis for online problems with adaptive adversaries.

problem Online prediction, discrepancy minimization, and online optimization with adaptive adversaries.
method General technique to prove smoothed guarantees against adaptive adversaries, reducing to simpler oblivious adversaries.
result Strong smoothed guarantees for three online problems, matching or improving previous results.

Paper proposes an algorithm for sampling from complex mixture distributions without requiring smoothness.

problem Sampling from a mixture of weakly smooth potentials.
method Unadjusted Langevin algorithm with Euler discretization for a mixture of weakly smooth distributions.
result Convergence in Kullback-Leibler divergence and LβL_β-Wasserstein metric with polynomial dependence on dimension.

We consider the energy of smooth generalized distributions and also of singular foliations on compact Riemannian manifolds for which the set of their singularities consists of a finite number of isolated points and of pairwise disjoint closed submanifolds. We derive a lower bound for the energy of all qq-dimensional a…

2015-12-04abs ↗pdf ↗

A new method for generating samples without training, using smoothed score matching.

problem Generating samples efficiently and without training.
method Moment-matched score-smoothed overdamped Langevin dynamics (MM-SOLD).
result The method enables fast, robust, training-free sampling with competitive sample fidelity and diversity.

New method samples from piecewise smooth distributions using Hamiltonian Monte Carlo.

problem Sampling from distributions with discontinuous gradients.
method Generalized Randomized Hamiltonian Monte Carlo (GRHMC) for piecewise smooth targets.
result GRHMC processes sample from piecewise smooth target distributions with the desired distribution as the invariant distribution.

FLUID uses flows to unify filtering and smoothing for complex systems.

problem Bayesian filtering and smoothing for high-dimensional nonlinear systems.
method FLUID encodes observation histories into a fixed summary statistic, using flows for filtering and smoothing.
result FLUID provides accurate approximations of filtering and smoothing distributions.

Optimal inference in distributed quantile regression without stringent scaling conditions.

problem Challenges in achieving optimal inference in distributed quantile regression due to the non-smooth nature of the QR loss function.
method Double-smoothing approach applied to local and global objective functions, with a trade-off between communication cost and statistical error.
result Established a finite-sample theoretical framework for distributed QR estimators, showing a trade-off between communication cost and statistical error.

New findings show learning deeper neural networks is hard even with Gaussian inputs and non-degenerate weights.

problem The computational complexity of learning neural networks, especially deeper ones.
method Smoothed analysis framework and local pseudorandom generators.
result Learning depth-3 ReLU networks under Gaussian input distribution is hard even if weight matrices are non-degenerate.

Let MM be a compact smooth manifold equipped with a positive smooth density μμ and HH be a smooth distribution endowed with a fiberwise inner product gg. We define the Laplacian ΔHΔ_H associated with (H,μ,g)(H,μ,g) and prove that it gives rise to an unbounded self-adjoint operator in L2(M,μ)L^2(M,μ). Then, assuming that HH

2016-06-07abs ↗pdf ↗

New findings on boosting sample complexity and implications for hardcore theorem.

problem Understanding the sample complexity of smooth boosting and its implications.
method Analyzing the sample complexity of smooth boosting and relating it to the hardcore theorem.
result The sample complexity of smooth boosting matches existing overhead and provides a separation from distribution-independent boosting.

New polynomial convergence guarantees for SGM on general data distributions.

problem Efficient guarantees for multimodal and non-smooth distributions in SGM.
method Polynomial convergence guarantees for denoising diffusion models on general data distributions, with no assumptions on functional inequalities or smoothness.
result Wasserstein distance guarantees for distributions of bounded support or decaying tails, and TV guarantees for further smoothness assumptions.

Quantifies polynomial approximation rates for smooth functions under various distributions.

problem Approximating smooth functions with polynomials under different distributional constraints.
method Develops a quantitative analogue of Carleman's theorem using complex analysis.
result Establishes superexponential rates of approximation for certain function classes over general distributions.

This work improves SGMs' convergence guarantees for semiconvex distributions with discontinuous gradients.

problem Establishing convergence guarantees for SGMs under weak regularity conditions.
method Developed non-asymptotic Wasserstein-2 convergence analysis for SGMs targeting semiconvex distributions with discontinuous gradients.
result Achieved optimal dependence of O(d)O(\sqrt{d}) on data dimension dd and convergence rate of order one.

New smoothing technique improves Wasserstein distance estimation in high dimensions.

problem Estimating statistical distances between high-dimensional distributions.
method Gaussian smoothing of pp-Wasserstein distance and analysis of its asymptotic behavior.
result Gaussian-smoothed pp-Wasserstein distance converges at rate n1/2n^{-1/2}, improving over n1/dn^{-1/d} for unsmoothed distances.

Smoothed analysis shows that many classes become learnable from positive-only samples.

problem Learning from positive-only samples is challenging due to negative results in worst-case settings.
method Smoothed analysis of positive-only learning, assuming samples from a reference distribution smooth with respect to the true distribution.
result All VC classes become learnable in the smoothed model with O(VC/ε2)O(VC/ε^2) positive samples for εε classification error.

Paper tackles distributed quantile regression with improved efficiency and support recovery.

problem Challenges in distributed estimation and support recovery for high-dimensional linear quantile regression.
method Transformed quantile regression into least-squares optimization, applied double-smoothing approach, developed efficient algorithm.
result Achieved near-oracle convergence rate and high support recovery accuracy.

This work studies the smooth 1-Wasserstein distance and its limit distribution in high dimensions.

problem Addressing the curse of dimensionality in empirical approximation.
method Conducts a statistical study including limit distribution, bootstrap consistency, and concentration inequalities.
result Derives a nondegenerate limit distribution for empirical SWD, contrasting with classic W1W_1.

We propose local distributional smoothness (LDS), a new notion of smoothness for statistical model that can be used as a regularization term to promote the smoothness of the model distribution. We named the LDS based regularization as virtual adversarial training (VAT). The LDS of a model at an input datapoint is defin…

2015-07-02abs ↗pdf ↗

New framework improves adversarial robustness certification for various perturbations.

problem Certifying robustness against adversarial attacks in deep learning models.
method Unified functional optimization approach with non-Gaussian smoothing noise for multiple types of attacks.
result Achieves better certification results and identifies key trade-offs between accuracy and robustness.

The purpose of this work is to develop and study a distributed strategy for Pareto optimization of an aggregate cost consisting of regularized risks. Each risk is modeled as the expectation of some loss function with unknown probability distribution while the regularizers are assumed deterministic, but are not required…

2019-09-20abs ↗pdf ↗