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.

169,051 papers · 148 categories

Trend · papers per month

0.3%0.5%0.8%0.4% · Dec 201019922001200920182026
6 results for distribution-splitting

New random forest criteria improve splitting for non-location structured data.

problem Improving random forest splitting for non-location structured data.
method Implement and compare various distributional splitting criteria inside a single honest-forest implementation.
result Distributional splitting criteria, especially sliced-Wasserstein, improve performance on multivariate responses.

This paper tackles target-dependent label complexity gap in active learning.

problem Target-dependent label complexity gap in Agnostic Active Learning.
method Introduces a novel distribution-splitting strategy based on number density to reduce label complexity and error rate.
result Provides theoretical guarantees and practical advantages for reducing label complexity and error rate.

We consider rank 3 distributions with growth vector (3,5,6). The class of such distributions splits into three subclasses: parabolic, hyperbolic and elliptic. In the present paper, we deal with the parabolic case. We provide a classification of such distributions and exhibit connections between them and Gl(2)-structure…

2010-12-03abs ↗pdf ↗

Study on Wasserstein distance for numerical approximations of stochastic differential equations.

problem Estimating the Wasserstein distance between stochastic differential equation distributions and their numerical approximations.
method Unified framework for analyzing different integrators and a novel splitting method for underdamped Langevin dynamics.
result A novel splitting method for underdamped Langevin dynamics with optimal complexity.

Improved convergence rates for Stein Variational Gradient Descent in finite-particle settings.

problem Improving convergence rates for Stein Variational Gradient Descent in finite-particle settings.
method Analyzing the time derivative of relative entropy and splitting it into dominant and smaller parts.
result Finite-particle convergence rates of order 1/\sqrt{N} for Kernelized Stein Discrepancy and Wasserstein-2 metrics.