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

Trend · papers per month

336699132 · May 202619922001200920172026
48 results for spectral decoupling

Spectral decoupling improves neural network generalization in medical imaging.

problem Poor generalization of neural networks trained on medical imaging data.
method Spectral decoupling, a regularization technique that encourages learning more features.
result Spectral decoupling increases network robustness and performance on external datasets.

Muon optimizer simplifies matrix optimization with spectral orthogonalization.

problem Matrix optimization challenges, especially with large condition numbers.
method Simplified Muon optimizer using spectral orthogonalization of gradients.
result Simplified Muon converges linearly with independent scalar sequences, outperforming gradient descent and Adam.

PolyNSD improves Neural Sheaf Diffusion with polynomial operators and spectral rescaling.

problem Limitations of common Neural Sheaf Diffusion implementations, including scalability and stability issues.
method Introduces Polynomial Neural Sheaf Diffusion (PolyNSD) with a degree-K polynomial propagation operator and spectral rescaling.
result PolyNSD achieves state-of-the-art results on both homophilic and heterophilic benchmarks with reduced runtime and memory requirements.

Inner product-based convolution has been a central component of convolutional neural networks (CNNs) and the key to learning visual representations. Inspired by the observation that CNN-learned features are naturally decoupled with the norm of features corresponding to the intra-class variation and the angle correspond…

2018-04-22abs ↗pdf ↗

The paper studies the convergence of harmonic metrics on Higgs bundles.

problem Analyzing the asymptotic behavior of harmonic metrics on Higgs bundles.
method Investigates the convergence of harmonic metrics on stable Higgs bundles of degree 0.
result The sequence of harmonic metrics converges to a decoupled harmonic metric at an exponential rate.

A spectral approach to building the exterior calculus in manifold learning problems is developed. The spectral approach is shown to converge to the true exterior calculus in the limit of large data. Simultaneously, the spectral approach decouples the memory requirements from the amount of data points and ambient space …

2018-02-04abs ↗pdf ↗

Defines and parametrizes sl(2)\mathfrak{sl}(2)-type singular fibres in symplectic and odd orthogonal Hitchin systems.

problem Characterizing and understanding singular fibres in Hitchin systems.
method Stratification by semi-abelian spectral data, study of irreducible components, global description of degenerations.
result Extension of Langlands duality to sl(2)\mathfrak{sl}(2)-type Hitchin fibres.

Deep learning explained through spectral filtering of hierarchical features.

problem Understanding how deep neural networks learn useful representations from data.
method Neural Low-Degree Filtering (Neural LoFi) as a stylized limit of gradient-based training.
result Predicts how representations are selected layer by layer and explains emergence of concepts.

We investigate finite-time decoupled convergence in nonlinear two-time-scale stochastic approximation.

problem Achieving decoupled convergence in nonlinear two-time-scale stochastic approximation.
method Nested local linearity assumption, suitable step size selection, convergence analysis of matrix cross term, fourth-order moment convergence rates.
result Finite-time decoupled convergence rates can be achieved in nonlinear two-time-scale stochastic approximation with proper step size selection.

Decoupled GCN is shown to be equivalent to label propagation.

problem Improving semi-supervised node classification in graph learning.
method The paper proves the equivalence of decoupled GCN and label propagation, and proposes a new method named PTA.
result Decoupled GCN is equivalent to two-step label propagation and can automatically assign weights to pseudo-labels.

New gauge preserves Einstein metrics' interactions, proving rigidity on negatively curved manifolds.

problem Stability and deformation theory of Einstein metrics.
method Introduces Chen-Nagano gauge condition, linking Lichnerowicz Laplacian to shifted scalar operator.
result Chen-Nagano gauge collapses to classical transverse-traceless gauge under spectral pinching assumptions.

A hybrid model combines diffusion and neural operator methods for stress prediction in hyperelastic materials.

problem Challenges in predicting stress fields in hyperelastic materials with complex microstructures.
method A hybrid surrogate framework combining a conditional denoising diffusion probabilistic model (cDDPM) and a modified DeepONet.
result The hybrid model consistently outperforms traditional methods by one to two orders of magnitude.

We investigate probabilistic decoupling of labels supplied for training, from the underlying classes for prediction. Decoupling enables an inference scheme general enough to implement many classification problems, including supervised, semi-supervised, positive-unlabelled, noisy-label and suggests a general solution to…

2019-05-29abs ↗pdf ↗

The paper proposes a decoupled approach to efficiently estimate CoVaR, a measure of systemic financial risk.

problem Estimating CoVaR, a measure of systemic financial risk, is challenging due to zero-probability events and portfolio repricing.
method The paper introduces a decoupled approach using smoothing techniques and a functional perspective to model CoVaR.
result The decoupled estimator achieves a rate of convergence of approximately OmP(Γ1/2)O_{ m P}(Γ^{-1/2}).

This paper investigates the effectiveness of decoupled weight decay at the start of training.

problem The traditional approach to weight decay is not effective throughout training.
method The authors investigate decoupled weight decay, applying it only at the start of training.
result Applying weight decay only at the start of training stabilizes network weights and improves performance.

Clarifies method of phase synchronization for decoupling linear differential equations.

problem Velocity-dependent transformations in linear second-order differential equations.
method Linear transformation of coordinates and velocities.
result Velocity-dependent transformations do not preserve second-order character and define their own system.

New insights explain why ββ-VAEs fail at disentanglement.

problem Disentanglement performance of ββ-VAEs peaks at intermediate ββ and collapses as regularization increases.
method Formalized information-theoretic mechanism, introduced λβλβ-VAE to stabilize disentanglement.
result Strong regularization pressure leads to mutual information collapse in ββ-VAEs.

We establish decoupled functional CLTs for two-time-scale stochastic approximation.

problem Understanding the asymptotic behavior of two-time-scale stochastic approximation.
method Martingale problem approach and auxiliary sequence.
result The limiting dynamics of two-time-scale SA are independent of each other.

Current reinforcement learning (RL) methods can successfully learn single tasks but often generalize poorly to modest perturbations in task domain or training procedure. In this work, we present a decoupled learning strategy for RL that creates a shared representation space where knowledge can be robustly transferred. …

2018-04-27abs ↗pdf ↗

Study spectral properties of sparse random graphs to recover latent vectors.

problem Recovering latent vectors in sparse random geometric graphs.
method Analyzes spectral concentration and uses orthogonal polynomial expansions, decoupling, and matrix concentration.
result Sharpens spectral norm bounds and proves exact recovery for Gaussian mixture models.

Backpropagation algorithm is indispensable for the training of feedforward neural networks. It requires propagating error gradients sequentially from the output layer all the way back to the input layer. The backward locking in backpropagation algorithm constrains us from updating network layers in parallel and fully l…

2018-04-27abs ↗pdf ↗

A new model decouples global and local image representations without supervision.

problem Learning decoupled global and local image representations without supervision.
method Variational auto-encoding framework with invertible generative flow.
result The model effectively learns decoupled representations of images.

New equations simplify gauge-theoretic Khovanov homology solutions.

problem Solving the Haydys-Witten equations for Khovanov homology.
method Introduced decoupled version of Haydys-Witten equations; investigated asymptotic behavior.
result Decoupled equations simplify analysis of full equations on manifolds with ends and boundaries.

Decoupled PFNs improve sequential decision-making by separating epistemic and aleatoric uncertainties.

problem Sequential decision-making requires distinguishing between epistemic uncertainty about latent signals and irreducible aleatoric observation noise.
method Developed a decoupled PFN architecture that uses query-level labels to train separate heads for latent signal and aleatoric noise.
result Empirically, decoupled PFNs mitigate the failure mode of total-variance exploration in noisy and heteroscedastic settings.

Novel Adam-family method with decoupled weight decay for training neural networks.

problem Training nonsmooth neural networks with weight decay.
method Proposes a novel Adam-family method with decoupled weight decay, establishing convergence properties and demonstrating superior performance.
result Asymptotically approximates SGD and enhances generalization performance.

DAPS++ improves diffusion-based image restoration by decoupling prior and likelihood.

problem Decoupling prior and likelihood in diffusion-based inverse problems for better performance.
method Introducing DAPS++, which separates diffusion initialization from likelihood refinement.
result DAPS++ achieves high computational efficiency and robust reconstruction performance.

New method uses diffusion models for Bayesian inverse problems.

problem Solving Bayesian inverse problems with linear-Gaussian models.
method Decoupled Diffusion Sequential Monte Carlo (DDSMC) method.
result Asymptotically exact solution demonstrated on various data types.

DAPS++ improves diffusion-based image restoration by decoupling prior and likelihood.

problem Decoupling prior and likelihood in diffusion-based inverse problems.
method Introducing DAPS++, which fully decouples diffusion-based initialization from likelihood-driven refinement.
result Achieves high computational efficiency and robust reconstruction performance.

We study the convolutional phase retrieval problem, of recovering an unknown signal xCn\mathbf x \in \mathbb C^n from mm measurements consisting of the magnitude of its cyclic convolution with a given kernel aCm\mathbf a \in \mathbb C^m . This model is motivated by applications such as channel estimation, optics, and u…

2017-12-03abs ↗pdf ↗

FTPL policy achieves best-of-both-worlds regret in decoupled bandits with reduced computational cost.

problem Decoupled multi-armed bandit problem with observed and unobserved losses.
method Follow-the-Perturbed-Leader (FTPL) policy that avoids convex optimization and resampling.
result Achieves constant regret in stochastic regime and optimal O(KT)O(\sqrt{KT}) regret in adversarial regime.

Introduces tunable basis functions for Gaussian processes.

problem Reduces computational complexity in Gaussian process approximations.
method Introduces tunable, local, and bounded basis functions for kernel approximation.
result Demonstrates superior performance compared to state-of-the-art methods, especially with poorly chosen kernel functions.

Study compares constrained and decoupled moduli spaces of manifolds with particles and discs.

problem Comparing constrained and decoupled moduli spaces of manifolds with embedded particles and discs.
method Generalized Bödigheimer--Tillmann's work to higher dimensions and different tangential structures.
result New results for surfaces with different tangential structures and higher dimensional manifolds.

Unsupervised representation learning via generative modeling is a staple to many computer vision applications in the absence of labeled data. Variational Autoencoders (VAEs) are powerful generative models that learn representations useful for data generation. However, due to inherent challenges in the training objectiv…

2019-11-24abs ↗pdf ↗

The paper extends macroscopic market making to stochastic games, revealing properties and solving equations.

problem Price competition among market makers in a stochastic game setting.
method Extension of macroscopic market making framework to stochastic games, introducing multidimensional characteristic equations.
result New well-posedness results for forward-backward stochastic differential equations.

Unified q-learning for mean-field jump-diffusion models with unobservable population distribution.

problem Continuous-time q-learning in mean-field jump-diffusion models with unobservable population distribution.
method Proposed decoupled Iq-function for unified policy evaluation in MFG and MFC problems; unified q-learning algorithm based on test policies and averaged martingale orthogonality condition.
result Unified policy evaluation rule for MFG and MFC problems based on decoupled Iq-function.