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

71142213284 · Jun 202019922001200920172026
48 results for non-uniform scaling

Enhances Fourier estimator performance for asynchronous event-data.

problem Improving correlation and covariance estimation on event-data.
method Implement and test NUFFT methods with different averaging kernels.
result Demonstrates improved performance and relationship between averaging scales.

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.

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.

Scalable kernel methods for large datasets using Fourier representations and NUFFT.

problem Cubic complexity in kernel methods limits their use on large-scale datasets.
method Fourier representation of kernels combined with NUFFT for O(n log n) complexity.
result Achieves minimax convergence rates and processes up to tens of billions of samples.

A new method for matrix completion with model-free weights.

problem Matrix completion under non-uniform missing structures.
method Constructs weights via convex optimization to adjust for non-uniformity without modeling observation probabilities.
result Recover matrix with stronger theoretical guarantees, especially in heterogeneous missing settings.

Accelerated coordinate descent is widely used in optimization due to its cheap per-iteration cost and scalability to large-scale problems. Up to a primal-dual transformation, it is also the same as accelerated stochastic gradient descent that is one of the central methods used in machine learning. In this paper, we imp…

2015-12-30abs ↗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 ↗

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.

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.

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 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.

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.

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 ↗

Generatability in metric spaces studied with novel novelty parameters.

problem Understanding generatability in metric spaces with asymmetric novelty parameters.
method Introducing (ε,ε)(\varepsilon,\varepsilon')-closure dimension to characterize uniform and non-uniform generatability.
result Generatability is stable across novelty scales in doubling spaces but can be highly scale-sensitive in general metric spaces.

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 ↗

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.

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.

The paper proves Zimmer's conjecture for non-uniform lattices by controlling mass escape and Lyapunov exponents.

problem Proving Zimmer's conjecture for non-uniform lattices in higher-rank semisimple Lie groups.
method Establishes finiteness of low-dimensional actions, introduces novel techniques to control mass escape and Lyapunov exponents.
result Proves Zimmer's conjecture for many non-uniform lattices, improving previous results.

The study finds that certain hyperbolic manifolds contain subgroups isomorphic to surface groups.

problem The existence of thin surface subgroups in non-uniform arithmetic lattices.
method Analyzes arithmetic hyperbolic manifolds and their fundamental groups.
result Fundamental groups of non-compact arithmetic hyperbolic manifolds contain thin surface subgroups.

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.

Let GG and GG' be simple Lie groups of equal real rank and real rank at least 22. Let Γ<GΓ<G and Λ<GΛ< G' be non-uniform lattices. We prove a theorem that often implies that any quasi-isometric embedding of ΓΓ into ΛΛ is at bounded distance from a homomorphism. For example, any quasi-isometric embedding of $SL(n,\ma…

2015-12-22abs ↗pdf ↗

This research examines how the error rate of nearest neighbor classifiers varies with dataset size.

problem The scaling of classification error rates with dataset size is not uniform.
method Theoretical analysis of nearest neighbor classifiers, focusing on early and late phases of dataset size.
result The error rate of nearest neighbor classifiers can have fine-grained rates depending on the dataset size and data distribution.

Sub-sampling is a common and often effective method to deal with the computational challenges of large datasets. However, for most statistical models, there is no well-motivated approach for drawing a non-uniform subsample. We show that the concept of an asymptotically linear estimator and the associated influence func…

2017-09-06abs ↗pdf ↗

The fundamental group of a Riemannian manifold with δδ-pinched negative curvature, δ>1/4δ>1/4, cannot be the fundamental group of a quasicompact Kähler manifold. The proof also implies that a non-uniform lattice in F4(20)F_{4(-20)} cannot be the fundamental group of a quasicompact Kähler manifold. We also construct examples …

2003-12-07abs ↗pdf ↗

Sequence models assign probabilities to variable-length sequences such as natural language texts. The ability of sequence models to capture temporal dependence can be characterized by the temporal scaling of correlation and mutual information. In this paper, we study the mutual information of recurrent neural networks …

2019-05-10abs ↗pdf ↗