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

Trend · papers per month

100201301401 · Jun 202019922001200920172026
48 results for feature decoupling

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 ↗

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.

Study shows how large neural networks avoid overfitting through decoupling of feature learning and complexity growth.

problem Understanding inductive bias and generalization in large neural networks.
method Dynamical mean field theory applied to large two-layer networks.
result Training dynamics of large networks exhibit a separation of timescales, decoupling feature learning and overfitting.

This work studies how contrastive learning extracts features from unlabeled data.

problem How neural networks trained by contrastive learning can extract features from unlabeled data.
method Formal analysis of contrastive learning's feature learning process, considering two types of features: sparse and dense.
result Contrastive learning using ReLU networks can learn sparse features if proper augmentations are adopted.

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.

PerPCA separates unique and shared features from heterogeneous data.

problem Extracting shared and unique features from data collected from different sources with varying trends.
method Personalized PCA (PerPCA) uses orthogonal global and local principal components to encode both unique and shared features.
result PerPCA can identify and recover both unique and shared features under mild conditions.

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.

Improved DNN calibration without sacrificing accuracy.

problem Poor calibration of over-parametrized DNNs in safety-critical applications.
method Decoupling feature extraction and classification layers, and applying Gaussian priors.
result Significant improvement in model calibration with minimal training cost.

We present two instances, L-GAE and L-VGAE, of the variational graph auto-encoding family (VGAE) based on separating feature propagation operations from graph convolution layers typically found in graph learning methods to a single linear matrix computation made prior to input in standard auto-encoder architectures. Th…

2019-10-18abs ↗pdf ↗

The paper proposes methods to extract and analyze individual variable information from complex dependencies.

problem Analyzing and understanding complex dependencies between multiple variables.
method Reversible normalization and iterative dependency reduction to extract individual information, and use it for direct mutual information and multi-feature Granger causality analysis.
result Decoupling of variables to analyze their individual information and direct mutual information transfers.

This paper introduces the factorial marked temporal point process model and presents efficient learning methods. In conventional (multi-dimensional) marked temporal point process models, event is often encoded by a single discrete variable i.e. a marker. In this paper, we describe the factorial marked point processes w…

2018-01-21abs ↗pdf ↗

Neural networks outperform kernels by learning features better.

problem Current theories of feature learning do not adequately assess feature quality.
method Introduced feature quality metric and examined existing theories empirically.
result Current theories of feature learning do not provide a sufficient foundation for neural network generalization.

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.

Regularized training of an autoencoder typically results in hidden unit biases that take on large negative values. We show that negative biases are a natural result of using a hidden layer whose responsibility is to both represent the input data and act as a selection mechanism that ensures sparsity of the representati…

2014-02-13abs ↗pdf ↗

Paper tackles self-supervised learning for non-homophilous graphs.

problem Existing self-supervised learning methods assume homophilous graphs, but real-world graphs often lack this assumption.
method Develops a decoupled self-supervised learning (DSSL) framework that decouples different semantics between neighborhoods.
result DSSL framework achieves better performance on various graph benchmarks compared to competitive baselines.

Study on feature learning dynamics in infinite-depth neural networks, focusing on ResNets.

problem Understanding how features evolve during training in deep neural networks, especially in the large-depth limit.
method Conditional Gaussian representations and SDE system with decoupled backward weights.
result Depth-induced suppression of forward-backward coupling in infinite-depth networks, leading to a decoupled forward-backward SDE system.

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.

Gradient Starvation causes neural networks to focus on a subset of features, leading to imbalance.

problem Neural networks focusing on only a subset of features despite having access to more.
method Using Dynamical Systems theory, identified properties of learning dynamics leading to feature imbalance.
result Gradient descent can lead to feature imbalance in over-parameterized networks.

Enhances Gaussian processes with spherical features for better scalability and flexibility.

problem Lack of representation learning in Gaussian processes compared to deep neural networks.
method Introduces spherical inter-domain features to improve GP approximation and scalability.
result The method alleviates limitations and improves scalability compared to alternative strategies.

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 ↗

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 ↗

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.

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.

Unified framework suppresses model bias in semi-supervised learning with decoupled sampling control.

problem Class imbalance in semi-supervised learning, especially with distributional mismatches.
method Unified framework SC-SSL with decoupled sampling control, explicit expansion capability, and adaptive sampling probabilities.
result Consistent and state-of-the-art performance across various benchmark datasets and distribution 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.

Training a neural network using backpropagation algorithm requires passing error gradients sequentially through the network. The backward locking prevents us from updating network layers in parallel and fully leveraging the computing resources. Recently, there are several works trying to decouple and parallelize the ba…

2018-07-12abs ↗pdf ↗