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

1.5%2.9%4.4%5.8% · Oct 201919922001200920172026
48 results for Non-Uniform Communication

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.

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.

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.

New method detects communities in hypergraphs by embedding them into a vector space.

problem Detecting communities in hypergraphs with multi-way interactions.
method Augmenting non-uniform hypergraphs, embedding into a vector space, using an alternative updating scheme.
result Asymptotic consistencies in community detection and hypergraph estimation established.

A new approach corrects bias in federated learning due to varying communication links.

problem Bias in federated learning due to non-uniform and time-varying communication links.
method Proposes Federated Postponed Broadcast (FedPBC) to correct bias in Federated Average (FedAvg).
result FedPBC converges to a stationary point of the global objective, overcoming bias caused by varying communication links.

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

Fault-tolerant federated learning for non-uniform data.

problem Faulty workers corrupting data in federated learning.
method Fault-resilient proximal gradient (FRPG) algorithm with Nesterov's acceleration and local FRPG for reduced communication.
result FRPG and LFRPG converge faster than robust stochastic aggregation.

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 ↗

Machine learning can help us in solving problems in the context big data analysis and classification, as well as in playing complex games such as Go. But can it also be used to find novel protocols and algorithms for applications such as large-scale quantum communication? Here we show that machine learning can be used …

2019-04-24abs ↗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.

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.

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 ↗

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 ↗

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.

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.

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.

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 ↗

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 ↗

This document describes the R package UBL that allows the use of several methods for handling utility-based learning problems. Classification and regression problems that assume non-uniform costs and/or benefits pose serious challenges to predictive analytic tasks. In the context of meteorology, finance, medicine, ecol…

2016-04-27abs ↗pdf ↗

Paper proposes a learning-based sparse Bayesian method for accurate off-grid DOA estimation.

problem One-bit off-grid direction of arrival (DOA) estimation in a single snapshot scenario.
method Formulated off-grid DOA estimation model, used Sparse Bayesian framework, proposed Learning-based Sparse Bayesian approach.
result Improved computational efficiency and accuracy in off-grid DOA estimation.

Frequency bias affects neural network training on non-uniform data.

problem Understanding how frequency bias impacts neural networks trained on non-uniformly distributed data.
method Used the Neural Tangent Kernel (NTK) model to explore the effect of variable density on training dynamics.
result Convergence time for learning a pure harmonic function depends on the local density at a point.