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

12.5%25.0%37.5%50.0% · May 199419922001200920172026
48 results for non-uniform random variates

We study the effectiveness of non-uniform randomized feature selection in decision tree classification. We experimentally evaluate two feature selection methodologies, based on information extracted from the provided dataset: (i)(i) \emph{leverage scores-based} and (ii)(ii) \emph{norm-based} feature selection. Experimenta…

2014-03-24abs ↗pdf ↗

Spectral algorithm recovers community structure in sparse hypergraphs.

problem Community detection in sparse random hypergraphs with community structure and higher-order interactions.
method Spectral algorithm with three steps: hyperedge selection, spectral partition, and correction/merging.
result Weak consistency achieved for weak signal-to-noise ratio.

Sharp threshold for exact recovery in non-uniform hypergraph stochastic block model.

problem Community detection in random hypergraphs with non-uniform hyperedge probabilities.
method Sharp threshold established; two efficient algorithms for exact recovery.
result Sharp threshold for exact recovery; information-theoretic lower bound on misclassification.

In this work we study the degree distribution, the maximum vertex and edge flow in non-uniform random Delaunay triangulations when geodesic routing is used. We also investigate the vertex and edge flow in Erdös-Renyi random graphs, geometric random graphs, expanders and random kk-regular graphs. Moreover we show that …

2012-03-22abs ↗pdf ↗

Validates conformal prediction for network data under non-uniform sampling.

problem Validity of conformal prediction for network data under non-representative sampling.
method Interprets sampling mechanisms as selection rules, studies validity conditional on selection events, uses permutation invariance and joint exchangeability.
result Finite-sample validity of conformal prediction for certain selection events and asymptotic validity for random walk sampling.

New method calculates Ricci curvature from distances between weighted volumes.

problem Calculating Ricci curvature for weighted Riemannian manifolds.
method Asymptotic retrieval of generalized Ricci tensor from scaled metric derivatives of Wasserstein 1-distances.
result Limiting coarse curvature of random graphs converges to generalized Ricci tensor.

Simulates financial market orders using anomalous diffusion models.

problem Anomalous diffusion in financial market order dynamics.
method Discrete Time Random Walk with Sibuya waiting times, non-uniform sampling, and cubic spline interpolation.
result Demonstrates price impact for different forcing functions and model parameters.

This paper considers a new family of variational distributions motivated by Sklar's theorem. This family is based on new copula-like densities on the hypercube with non-uniform marginals which can be sampled efficiently, i.e. with a complexity linear in the dimension of state space. Then, the proposed variational densi…

2019-04-15abs ↗pdf ↗

The study finds non-uniform lattices with thin Hitchin representations in specific Lie groups.

problem Finding thin Hitchin representations in non-uniform lattices of Lie groups.
method Arithmetic methods to construct thin Hitchin representations.
result Infinitely many orbits of thin Hitchin representations in non-uniform lattices.

New approach to adversarial robustness with non-uniform perturbations.

problem Real-world adversaries craft adversarial examples with non-uniform perturbations.
method Proposes non-uniform perturbations based on feature dependencies and data distribution.
result Shows improved robustness to real-world attacks compared to uniform perturbations.

This work studies the robustness certification problem of neural network models, which aims to find certified adversary-free regions as large as possible around data points. In contrast to the existing approaches that seek regions bounded uniformly along all input features, we consider non-uniform bounds and use it to …

2019-03-15abs ↗pdf ↗

The notion of expense in Bayesian optimisation generally refers to the uniformly expensive cost of function evaluations over the whole search space. However, in some scenarios, the cost of evaluation for black-box objective functions is non-uniform since different inputs from search space may incur different costs for …

2019-09-09abs ↗pdf ↗

Many stochastic optimization algorithms work by estimating the gradient of the cost function on the fly by sampling datapoints uniformly at random from a training set. However, the estimator might have a large variance, which inadvertently slows down the convergence rate of the algorithms. One way to reduce this varian…

2017-08-08abs ↗pdf ↗

New insights into variational inference using Monte Carlo estimates.

problem Improving variational bounds in latent variable models.
method Analyzing properties of Monte Carlo estimates and their impact on variational gaps.
result Negative correlation reduces variational gaps, contrary to intuition.

New approach finds minima of geodesic lengths for non-uniform fillings.

problem Finding minima of geodesic length functions for non-uniform fillings.
method Elementary optimization for 4-regular topological fillings, analysis of fat graphs and optimization techniques.
result Minima of geodesic length functions are found to be at triangle surfaces in both analyzed classes of non-uniform fillings.

The paper studies random covers of torus knot complements and their statistical properties.

problem Understanding the statistical behavior of finite covers of torus knot complements.
method Asymptotic subgroup growth analysis and Benjamini-Schramm limit theorems.
result Determination of the linear growth rate of Betti numbers for random covers of torus knot complements.

We consider the problem of finding the minimizer of a convex function F:RdRF: \mathbb R^d \rightarrow \mathbb R of the form F(w):=i=1nfi(w)+R(w)F(w) := \sum_{i=1}^n f_i(w) + R(w) where a low-rank factorization of 2fi(w)\nabla^2 f_i(w) is readily available. We consider the regime where ndn \gg d. As second-order methods prove to be effective in…

2016-07-02abs ↗pdf ↗
Lazier ABCstat.CO

ABC algorithms involve a large number of simulations from the model of interest, which can be very computationally costly. This paper summarises the lazy ABC algorithm of Prangle (2015), which reduces the computational demand by abandoning many unpromising simulations before completion. By using a random stopping decis…

2015-01-21abs ↗pdf ↗

Non-uniform lattices in PU(n,1) cannot geometrically act on CAT(0) cube complexes.

problem Non-uniform lattices in PU(n,1) cannot geometrically act on CAT(0) cube complexes.
method Proving non-uniform lattices in PU(n,1) cannot geometrically act on CAT(0) cube complexes.
result Non-uniform lattices in PU(n,1) cannot geometrically act on CAT(0) cube complexes.

New algorithm achieves strong consistency in binary non-uniform hypergraph classification.

problem Node classification on binary non-uniform hypergraphs with varying edge probabilities.
method Proposes a refinement algorithm using power iteration on weighted adjacency matrices.
result Proves optimality of the refinement algorithm, achieving strong consistency and IT lower bound.

New method detects communities in complex hypergraphs, matching theoretical limits.

problem Detecting communities in non-uniform hypergraphs with varying hyperedge sizes.
method Developed a spectral theory for weighted non-backtracking operators on non-uniform hypergraphs.
result Achieved the Kesten-Stigum bound for weak recovery in a general class of non-uniform HSBMs.

Improved sampling accuracy in SG-MCMC methods via non-uniform gradient subsampling.

problem Computational inefficiency and sampling error in stochastic gradient MCMC methods.
method Proposes a non-uniform subsampling scheme to reduce sampling error in EWSG, a variant of SG-MCMC.
result EWSG reduces sampling error compared to uniform subsampling, improving accuracy without sacrificing convergence speed.

A groupoid Ω(B)Ω\left( \mathcal{B} \right) called material groupoid is naturally associated to any simple body B\mathcal{B}. The material distribution is introduced due to the (possible) lack of differentiability of the material groupoid. Thus, the inclusion of these new objects in the theory of material bodies opens th…

2018-12-11abs ↗pdf ↗

Paper extracts features from time series to improve forecasting accuracy.

problem Forecasting time series generated by Itô-type processes with unknown coefficients.
method Statistical adjustment of mixture-type models to extract features from time series data.
result Additional statistical features enhance time series prediction accuracy.

Improved matrix completion for non-uniformly sampled data.

problem Estimating unobserved entries in a matrix with varying sampling probabilities.
method Developed entry-specific bounds for low-rank matrix completion under structured non-uniform sampling.
result Error bounds for each entry match minimax lower bounds under certain conditions.

New loss function equivalence reveals PER's uniform sampling can be improved.

problem Improving Prioritized Experience Replay (PER) for better learning efficiency.
method Transforming non-uniformly sampled data loss functions into uniformly sampled ones.
result Some environments can replace PER with a new loss function without performance loss.

We address the following problem: given two smooth densities on a manifold, find an optimal diffeomorphism that transforms one density into the other. Our framework builds on connections between the Fisher-Rao information metric on the space of probability densities and right-invariant metrics on the infinite-dimension…

2015-01-29abs ↗pdf ↗