This paper studies MMV problem and its performance, proving a decoupling property for MMV algorithms.
problem Joint estimation of multiple signal realizations with common sparse support.
method Proved a decoupling property for ℓ 2 , 1 \ell_{2,1} ℓ 2 , 1 -LS algorithm, decomposing it into coupled and decoupled phases. result Performance of ℓ 2 , 1 \ell_{2,1} ℓ 2 , 1 -LS and MMV algorithms are affected by signal correlations and dictionary mismatch. 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.
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.
DEKF maintains stability in LSTM learning with bounded perturbations.
problem Stability of DEKF in LSTM-based online learning.
method Modeling DEKF as a perturbed extended Kalman filter and deriving stability conditions.
result DEKF learns LSTM parameters with similar stability properties to the global extended Kalman filter.
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.
Stylized facts can be regarded as constraints for any modeling attempt of price dynamics on a financial market, in that an empirically reasonable model has to reproduce these stylized facts at least qualitatively. The dynamics of market prices is modeled on a macro-level as the result of the dynamic coupling of two dyn…
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.
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…
Study on octonionic Nahm's equations and their moduli space properties.
problem Properties of octonionic Nahm's equations and their moduli space.
method Analyzing basic properties, constructing solutions, introducing symmetry, proving theorems.
result Moduli space of smooth solutions to octonionic Nahm's equations over [0,1] is a star-shaped smooth manifold.
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.
We make policy optimization algorithms batch size-invariant by decoupling proximal and behavior policies.
problem Some policy optimization algorithms do not have batch size-invariance, leading to inefficiencies.
method We decouple the proximal policy from the behavior policy to achieve batch size-invariance.
result Our approach makes policy optimization algorithms more efficient and allows them to use stale data more effectively.
Probabilistic decoupling separates labels from classes for improved classification.
problem Improving classification accuracy with noisy or partially labeled data.
method Probabilistic decoupling of labels from underlying classes.
result Method enhances performance on various classification tasks, including noisy and partially labeled data.
New heat semigroup characterizes Sobolev and BV spaces in Carnot groups.
problem Lack of explicit representations and symmetry in heat kernels in sub-Riemannian geometry.
method Establishes a new heat semigroup characterisation using integral decoupling property.
result Characterizes Sobolev and BV spaces in Carnot groups.
We analyze a new type of debt that rewards investors based on company performance.
problem Challenges in accounting and pricing equity-based debt obligations.
method Formulated and solved the associated mathematical problem in discrete and continuous time settings using FBSDE and decoupling fields.
result Solved the continuous time problem using FBSDE and decoupling fields.
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.
This paper uncovers the low-rank structure of neural network Hessians.
problem Understanding the structure of Hessians in neural networks.
method Proposes a decoupling conjecture to decompose layer-wise Hessians into Kronecker products of smaller matrices.
result Proves the structure of top eigenspaces in 2-layer networks and shows high overlap in top eigenvectors across different models.
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.
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.
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 O m P ( Γ − 1 / 2 ) O_{
m P}(Γ^{-1/2}) O m P ( Γ − 1/2 ) . DECAF optimizes molecular graphs for ensemble properties, improving drug design accuracy.
problem Designing molecules with ensemble properties rather than single conformations.
method DECAF uses Boltzmann-expected design with decoupled annealing flows to optimize molecular graphs.
result DECAF optimizes molecular graphs to shift ensemble properties towards targets, improving accuracy over single-conformer methods.
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.
Global watermark for diffusion language models decouples detection from local contexts.
problem Watermarking in diffusion language models is challenging due to joint sampling of distributions over many unresolved positions.
method Proposes a global vector-valued sketch representation to control watermarking in masked diffusion language models.
result The method decouples detection from local contexts, resulting in an order-agnostic statistic and robustness.
In this paper, we study the generalization properties of online learning based stochastic methods for supervised learning problems where the loss function is dependent on more than one training sample (e.g., metric learning, ranking). We present a generic decoupling technique that enables us to provide Rademacher compl…
New bounds for SGD generalize without mutual information terms.
problem Generalizing SGD's learning dynamics for heavy-tailed distributions.
method Introducing a geometric decoupling term and bounding it computably.
result Proved generalization bounds without mutual information terms.
Kahler geometry explains decoupling of Kerr perturbations.
problem Decoupling of curvature scalars in Kerr spacetime.
method Hidden Kahler structure in Kerr spacetime, showing decoupling as a consequence of Kahler geometry.
result Decoupling of Teukolsky equations on Kahler background.
AdaDEM decouples EM into two parts to improve class overlap and uncertainty.
problem Improper EM limits its effectiveness in various machine learning tasks.
method Decouple EM into CADF and GMC, and AdaDEM normalizes CADF reward and uses MEC.
result AdaDEM outperforms classical EM and improves performance in noisy and dynamic environments.
Recent variants improve knowledge distillation performance.
problem Improving the performance of knowledge distillation.
method Introducing additional components or changing the learning process.
result These variants have shown promising results.
New algorithms for interpreting complex multivariate functions.
problem Hard interpretation of multivariate functions due to many parameters.
method Filtered tensor decompositions of derivative information.
result Nonparametric estimates of smooth decoupled functions.
New method combines spectral and sparse methods for Gaussian processes.
problem Efficiently fitting Gaussian processes to large datasets.
method Orthogonally decoupled variational Fourier features.
result Competitive performance on synthetic and real-world data.
The study examines volatility models and finds decoupling of short- and long-term correlation structures.
problem Understanding the dynamic of volatility at different time scales.
method Developed a composite likelihood estimation framework for parametric continuous-time stationary Gaussian processes.
result The short- and long-term correlation structures of stochastic volatility are decoupled.
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. …
dpVAEs improve VAEs by decoupling representation and generation.
problem VAEs struggle with both representation learning and sample generation.
method Introduce decoupled priors (dpVAEs) that separate representation and generation spaces.
result dpVAEs enable regularization without compromising sample generation.
Unified algorithm for minimizing composite functions with flexible design.
problem Minimizing composite functions with specific structural properties.
method Unified accelerated algorithm for complementary composite minimization.
result Near-optimal algorithms for various optimization problems.
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…
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.
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.
Study proves global existence and decay for complex wave equations.
problem Global existence and decay for quasilinear wave equations with weak-null condition.
method Novel decoupling of higher order energy estimates, focusing on tangential components.
result Established global existence and decay for solutions with small data.
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.
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.
Novel Bayesian prior for neural networks encodes amplitude and lengthscale.
problem Lack of user-friendly priors for specifying basic properties in Bayesian neural networks.
method Introduced Poisson Process Radial Basis Function Networks (PP-RBFN) as a novel prior.
result PP-RBFN allows decoupled specification of amplitude and lengthscale, and estimated function is consistent.
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.
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 ( K T ) O(\sqrt{KT}) O ( K T ) regret in adversarial regime. Extends capacity analysis to neural networks, showing how capacity is distributed across layers.
problem How capacity is distributed in neural networks with non-linear layers.
method Introduces layer decoupling to quantify non-linear activation's impact, and uses a markovian rule for capacity propagation in deep networks.
result Shows that under certain conditions, capacity allocation in neural networks is equivalent to linear capacity allocation in an extended input space.
Cryptocurrency market decouples from Forex, showing multifractality.
problem Decoupling of crypto market from Forex.
method High-frequency recordings and multiscale cross-correlations.
result Cryptocurrency market shows multifractality, decoupling from Forex.
We develop a novel family of algorithms for the online learning setting with regret against any data sequence bounded by the empirical Rademacher complexity of that sequence. To develop a general theory of when this type of adaptive regret bound is achievable we establish a connection to the theory of decoupling inequa…
New method detects heuristics in complex game strategies.
problem Understanding decision-making in games with infinite strategy spaces.
method Introducing decoupled strategies to detect convergence towards Nash equilibria.
result Predictive measure ΔD reveals participants' actions with high success rate.
In this paper we propose a general derivative pricing framework which employs decoupled time-changed (DTC) Lévy processes to model the underlying asset of contingent claims. A DTC Lévy process is a generalized time-changed Lévy process whose continuous and pure jump parts are allowed to follow separate random time scal…