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

148295443590 · Jun 202019922001200920172026
48 results for covering distribution

New bounds for private learning of high-dimensional Gaussian distributions.

problem Learning high-dimensional Gaussian distributions under differential privacy constraints.
method Analytic tools for constructing global covers from local covers, modified hypothesis selection techniques.
result Near-optimal sample complexity bounds for general Gaussians, conjectured to be near-optimal in the general case.

Study shows offline RL with partial coverage and weak function classes is possible.

problem Learning optimal policies from logged data with function approximation.
method Marginalized Importance Sampling (MIS) with additional covering distribution.
result Finite-sample guarantees for sample-efficient offline RL for general MDPs.

Random square-tiled surfaces have normal genus distribution and cover all integer vectors.

problem Distribution and properties of random square-tiled surfaces.
method Randomizing model and local central limit theorem for genus.
result The distribution of the genus is asymptotically normal and contains all primitive integer vectors.

Optimizes cover parameter in Mapper algorithm for better visualization.

problem Tuning the cover parameter in Mapper algorithm to generate a ``nice'' graph.
method Optimizes cover by repeatedly splitting using statistical tests and Gaussian mixture model.
result Algorithm generates covers that retain dataset essence while being faster.

New insights show coverage conditions are crucial for efficient online reinforcement learning.

problem The role of coverage conditions in determining sample complexity of offline reinforcement learning.
method Established a connection between coverage conditions and sample efficiency in online reinforcement learning.
result Coverability, a structural property of MDPs, enables sample-efficient exploration in online reinforcement learning.

Study smooth linear statistics on random covers of hyperbolic surfaces, showing central limit and variance results.

problem Analyzing fluctuations and energy variance of random covers of compact hyperbolic surfaces.
method Examining fluctuations in a small energy window around a fixed energy level, considering the variance of a typical surface, using a double limit where nn and LL go to infinity.
result Distribution of fluctuations tends to a Gaussian with variance of GOE/GUE, and energy variance of a typical random nn-cover is that of GOE/GUE.

We give an explicit formula for the limiting gap distribution of slopes of saddle connections on the golden L, or any translation surface in its SL(2, R)-orbit, in particular the double pentagon. This is the first explicit computation of the distribution of gaps for a flat surface that is not a torus cover.

2013-08-20abs ↗pdf ↗

The Wasserstein metric is an important measure of distance between probability distributions, with applications in machine learning, statistics, probability theory, and data analysis. This paper provides upper and lower bounds on statistical minimax rates for the problem of estimating a probability distribution under W…

2018-02-24abs ↗pdf ↗

Following I. S. Krasilshchik and A. M. Vinogradov, we regard PDEs as infinite-dimensional manifolds with involutive distributions and consider their special morphisms called differential coverings, which include constructions like Lax pairs and Backlund transformations. We show that, similarly to usual coverings in top…

2003-01-28abs ↗pdf ↗

New algorithm reduces prediction error in online learning without knowing base measure.

problem Smoothed online learning without knowledge of base measure.
method R-Cover algorithm based on recursive coverings.
result First algorithm to guarantee sublinear regret for agnostic smoothed online learning without prior knowledge of base measure.

Study of Alexander polynomials of torus knots and links, showing zeros equidistribute on unit circle.

problem Analyzing asymptotic behavior and distribution of zeros of Alexander polynomials of torus knots.
method Equidistribution analysis, moment sequence, Iwasawa theory, logarithmic Mahler measure.
result Zeros of Alexander polynomials of torus knots and links become equidistributed on the unit circle as p, q → ∞.

We provide a differentially private algorithm for hypothesis selection. Given samples from an unknown probability distribution PP and a set of mm probability distributions H\mathcal{H}, the goal is to output, in a ε\varepsilon-differentially private manner, a distribution from H\mathcal{H} whose total variation di…

2019-05-30abs ↗pdf ↗

Method proposed for pricing insurance products covering both foreseeable and unforeseeable risks.

problem Pricing insurance products that include unforeseeable risks.
method Mixed Poisson process with Bayesian setup and linear exponential family distributions.
result Bayesian premiums are more reactive to claim trends than traditional ones.

Standard adversarial training involves two agents, namely a generator and a discriminator, playing a mini-max game. However, even if the players converge to an equilibrium, the generator may only recover a part of the target data distribution, in a situation commonly referred to as mode collapse. In this work, we prese…

2019-02-21abs ↗pdf ↗

This paper reviews various sampling methods from statistics and machine learning.

problem Addressing sampling methods in statistics and machine learning.
method Explains and reviews simple random sampling, bootstrapping, stratified sampling, cluster sampling, multistage sampling, network sampling, snowball sampling, and sampling from cumulative distribution function.
result Summarizes characteristics, pros, and cons of different sampling methods.

We consider actions of Z^k, k \ge 2, by Anosov diffeomorphisms which are uniformly quasiconformal on each coarse Lyapunov distribution. These actions generalize Cartan actions for which coarse Lyapunov distributions are one-dimensional. We show that, under certain non-resonance assumptions on the Lyapunov exponents, a …

2006-08-23abs ↗pdf ↗

Study tackles distribution shift in combinatorial settings using matrix completion techniques.

problem Tackling distribution shift in combinatorial settings with rigorous statistical guarantees.
method Develops novel algorithms and theoretical results for extrapolating to test distributions not covered in training.
result Achieves bilinear combinatorial extrapolation under gradual spectral decay in high-dimensional data.

This paper proposes an online tree-based Bayesian approach for reinforcement learning. For inference, we employ a generalised context tree model. This defines a distribution on multivariate Gaussian piecewise-linear models, which can be updated in closed form. The tree structure itself is constructed using the cover tr…

2013-05-08abs ↗pdf ↗

JRFs improve semi-supervised learning by balancing generation and classification.

problem Mode missing and mode covering issues in GANs and VAEs, and conflict between good classification and generation.
method Joint-stochastic-approximation random fields (JRFs) for deep undirected generative models.
result JRFs achieve good classification and generation results in SSL.

In this paper, we study the risk bounds for samples independently drawn from an infinitely divisible (ID) distribution. In particular, based on a martingale method, we develop two deviation inequalities for a sequence of random variables of an ID distribution with zero Gaussian component. By applying the deviation ineq…

2012-02-14abs ↗pdf ↗

Analytic torsion defined for rank 2 distributions on 5-manifolds.

problem Defining and analyzing analytic torsion for rank 2 distributions.
method Proposed an analytic torsion for Rumin complex associated with rank 2 distributions on 5-manifolds, established anomaly formulas, and showed coincidence with Ray-Singer torsion.
result The proposed torsion coincides with Ray-Singer torsion for certain nilmanifolds.

Consider a family of portfolio strategies with the aim of achieving the asymptotic growth rate of the best one. The idea behind Cover's universal portfolio is to build a wealth-weighted average which can be viewed as a buy-and-hold portfolio of portfolios. When an optimal portfolio exists, the wealth-weighted average c…

2015-10-09abs ↗pdf ↗

A {\em solvable} cover of a graph is a regular cover whose covering transformation group is solvable. In this paper, we show that a solvable cover of a graph can be decomposed into layers of abelian covers, and also, a lift of a given automorphism of the base graph of a solvable cover can be decomposed into layers of l…

2012-09-19abs ↗pdf ↗

After showing that a covering space of surface bundles over S1S^1 factors as a `covering of fibers' followed by a `power covering', we prove that, for torus bundles, power coverings do not lower Heegaard genus, and that fiber coverings lower the genus only in special cases.

2015-04-28abs ↗pdf ↗

In "Rips complexes and covers in the uniform category" \cite{Rips} the authors define, following James \cite{J}, covering maps of uniform spaces and introduce the concept of generalized uniform covering maps. Conditions for the existence of universal uniform covering maps and generalized uniform covering maps are given…

2010-08-02abs ↗pdf ↗

Bayesian framework improves ML classification models' uncertainty estimates.

problem Ensuring trustworthy AI predictions with explicit uncertainty quantification.
method Proposes a Bayesian framework for generative ML classification models that accounts for input measurement uncertainty.
result The BQDA model outperforms other models in terms of interpretability, explicit uncertainty modeling, and computational efficiency.

A foliation of a manifold M is called R-covered if its lift to the universal cover of M has space of leaves R. We show that there are many graph manifolds which admit taut foliations, but which do not admit any R-covered foliations. On the other hand, we show that these manifolds all have finite covers admitting R-cove…

2000-11-17abs ↗pdf ↗

We discuss construction of coverings of the unit ball of a finite dimensional Banach space. The well known technique of comparing volumes gives upper and lower bounds on covering numbers. This technique does not provide a construction of good coverings. Here we apply incoherent dictionaries for construction of good cov…

2013-01-10abs ↗pdf ↗

We investigate the shape of the Italian personal income distribution using microdata from the Survey on Household Income and Wealth, made publicly available by the Bank of Italy for the years 1977--2002. We find that the upper tail of the distribution is consistent with a Pareto-power law type distribution, while the r…

2004-08-03abs ↗pdf ↗