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,982 papers · 148 categories

Trend · papers per month

85169254338 · May 202619922001200920172026
48 results for local separability

This work learns sparse tensor representations using mixtures of separable dictionaries.

problem Learning sparse representations of tensor data with structured models.
method Proposes and explores learning a mixture of separable dictionaries with sufficient conditions for local identifiability.
result Developed computational algorithms for batch and online learning.

The paper proves local laws for non-separable sample covariance matrices.

problem Analyzing non-separable sample covariance matrices with dependent or nonlinearly transformed data.
method Tensor network framework for analyzing fluctuation averaging in the presence of higher-order cumulant structure.
result Optimal averaged local law and full anisotropic local law for non-separable sample covariance matrices.

Gradient descent-ascent converges to strict local minmax equilibria with a finite timescale separation.

problem Analyzing the convergence of gradient descent-ascent in non-convex, non-concave games with a finite timescale separation.
method Investigates the role of a finite timescale separation parameter τ on gradient descent-ascent in two-player zero-sum games, providing convergence rates and non-convergence results.
result Gradient descent-ascent converges to strict local minmax equilibria for a finite timescale separation parameter τ*.

Study reveals structure of local minima in GMMs, identifying key cluster centers.

problem Identifying optimal cluster centers in non-convex GMM landscapes.
method Analyzing the negative log-likelihood function of GMMs in the population limit.
result Local minima share a common structure that partially identifies true cluster centers.

Study models deep learning training dynamics using locally elastic SDEs to reveal feature separability.

problem Understanding how deep learning models separate features from different classes during training.
method Modeling deep learning training using locally elastic SDEs with a drift term reflecting backpropagation impact.
result Local elasticity in SDEs leads to linear separability of features, resulting in vanishing training loss.

It is shown that the hyperspace of all nonempty closed subsets $\Cld_{AW}(X)$ of a separable metric space XX endowed with the Attouch-Wets topology is homeomorphic to a separable Hilbert space if and only if the completion of XX is proper, locally connected and contains no bounded connected component, XX is topologi…

2008-03-14abs ↗pdf ↗

Neural networks can learn Boolean circuits with local correlation.

problem Learning Boolean circuits with neural networks is computationally hard.
method Observing local correlation between input patterns and target labels, focusing on tree-structured Boolean circuits.
result Local correlation determines the success or failure of optimization in learning Boolean circuits.

Local Gradient Descent with local steps converges to the centralized model in the interpolation regime.

problem Understanding the implicit bias of Local Gradient Descent in the interpolation regime.
method Analyzing the implicit bias of Local Gradient Descent for classification tasks with linearly separable data.
result The aggregated global model from Local-GD converges exactly to the centralized model in the interpolation regime.

For an infinite cardinal κκ let 2(κ)\ell_2(κ) be the linear hull of the standard othonormal base of the Hilbert space 2(κ)\ell_2(κ) of density κκ. We prove that a non-separable convex subset XX of density κκ in a locally convex linear metric space if homeomorphic to the space (i) 2f(κ)\ell_2^f(κ) if and only if XX can be…

2013-05-07abs ↗pdf ↗

Paper investigates separating times for general diffusions, providing new insights.

problem Understanding phase transitions between equivalence and singularity in diffusions.
method Representation of separating time as hitting time of a deterministic set, characterized by speed and scale.
result Explicit and easy-to-check conditions for absolute continuity and singularity of diffusions.

New methods test discrete distributions faster with local privacy constraints.

problem Testing discrete distributions under local differential privacy constraints.
method Efficient randomized algorithms and test procedures, both non-interactive and interactive.
result Faster separation rates in interactive privacy mechanisms.

We consider the closeness testing problem for discrete distributions. The goal is to distinguish whether two samples are drawn from the same unspecified distribution, or whether their respective distributions are separated in L1L_1-norm. In this paper, we focus on adapting the rate to the shape of the underlying distri…

2019-02-01abs ↗pdf ↗

Enhanced Hopfield model boosts memory retrieval capacity.

problem Memory retrieval in modern Hopfield models with limited capacity.
method Introduces a learnable feature map transforming energy function into kernel space, minimizing separation loss for uniform memory distribution.
result Significant reduction in metastable states, enhancing memory capacity and retrieval accuracy.

We compute the Hilbert polynomial and the Poincare function counting the number of fixed jet-order differential invariants of conformal metric structures modulo local diffeomorphisms, and we describe the field of rational differential invariants separating generic orbits of the diffeomorphism pseudogroup action. This r…

2016-04-22abs ↗pdf ↗

New kernels capture both local and non-local interactions efficiently.

problem Designing kernels that capture both local and non-local interactions while remaining computationally tractable.
method Spectral truncation kernels based on CC^*-algebra.
result Spectral truncation kernels induce interactions across the data function domain and reduce computational cost.

The study quantifies how many objects can be linearly classified under all views.

problem Understanding the expressivity of group-equivariant representations.
method Generalization of Cover's Function Counting Theorem to quantify separable dichotomies.
result The fraction of separable dichotomies is determined by the fixed space dimension of the group action.

A new unsupervised method separates speech sources without requiring labeled data.

problem Lack of supervised data for effective neural source separation.
method Uses a complex Gaussian mixture model (cGMM) for joint training of separation and localization networks.
result The method outperforms conventional initialization methods in monaural and multichannel separation.

EM algorithm achieves optimal sample complexity for well-separated Gaussian mixtures.

problem Estimating parameters of well-separated Gaussian mixtures.
method New EM convergence proof for well-separated Gaussian mixtures.
result EM algorithm converges with Ω(logk)Ω(\sqrt{\log k}) separation, achieving O(kd/ε2)O(kd/ε^2) samples.

Understanding separation effects on parameter estimation in finite Gaussian mixtures

problem Minimum component separation impact on convergence rates in finite Gaussian mixtures
method Developing a unified geometric framework using Hellinger lower bounds and specialized moment-extraction test functions
result Separation complexity driven by spatial configuration of mixture components

Bayesian Federated Inference combines local data analyses to estimate regression models.

problem Estimating accurate parameters with limited data from different centers.
method Bayesian Federated Inference (BFI) for pooling local data analyses.
result Excellent performance of BFI methodology shown in real-life examples.

We introduce a comprehensive and statistical framework in a model free setting for a complete treatment of localized data corruptions due to severe noise sources, e.g., an occluder in the case of a visual recording. Within this framework, we propose i) a novel algorithm to efficiently separate, i.e., detect and localiz…

2014-09-30abs ↗pdf ↗

CNNs require fewer samples than LCNs and FCNs for image-based tasks due to locality and weight sharing.

problem Quantifying statistical benefits of locality and weight sharing in CNNs over LCNs and FCNs.
method Dynamic Signal Distribution (DSD) task and information theoretic tools.
result CNNs require fewer samples than LCNs and FCNs for image-based tasks.