New algorithms reduce online learning regret using empirical Rademacher complexity.
problem Adaptive online learning with bounded regret against any sequence.
method Developed a novel family of algorithms based on empirical Rademacher complexity and decoupling inequalities.
result Achieved adaptive regret bounds for various hypothesis classes.
A new framework decouples CNN features into intra-class and semantic differences.
problem Learning visual representations in CNNs is challenging.
method Proposes a decoupled learning framework that models intra-class variation and semantic difference independently.
result Decoupled reparameterization leads to significant performance gains and easier convergence.
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.
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.
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.
Improved sampling from mean-field stationary distributions.
problem Sampling from the stationary distribution of mean-field SDEs.
method Decoupling the problem into two aspects: approximation of mean-field SDE and sampling from finite-particle distribution.
result Improved guarantees in various settings, including optimizing neural networks.
We provide bounds for kernel matrices and new approximations for high-dimensional data.
problem Approximating high-dimensional empirical kernel matrices.
method Decoupling results for U-statistics and non-commutative Khintchine inequality.
result New tighter approximations for inner-product kernel matrices.
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 ) . Decouples RL components for better task transfer and robustness.
problem Poor generalization in reinforcement learning to task domain changes.
method Separates learning into task representation, dynamics, and reward.
result Decoupling improves performance and robustness to domain changes.
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.
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.
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…
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.
New method decouples learning rules from representations in AI.
problem Coupling of learning rules and representations leads to inconsistent outcomes.
method Developed a method to partially decouple learning rules from representations for various learning types.
result Achieved partial decoupling of learning rules and representations for a wide range of learning rules.
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.
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.
A new decoupled approach for Gaussian processes reduces complexity and improves performance.
problem Superlinear complexity in sparse variational inference methods for Gaussian processes.
method Orthogonally decoupling the mean and covariance functions of Gaussian processes to achieve linear complexity and expressive posterior mean functions.
result Our method achieves significantly faster convergence compared to state-of-the-art approaches.
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.
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. 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.
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.
Proposes a new backpropagation algorithm for deep learning with guaranteed convergence.
problem Backward locking in backpropagation limits parallel updates in deep neural networks.
method Decouples gradients and splits the network into modules for parallel updates, proving convergence for non-convex problems.
result The proposed algorithm achieves significant speedup without accuracy loss in training deep convolutional neural networks.
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.
This paper tackles efficient learning for factorial marked temporal point processes.
problem Efficient learning for factorial marked temporal point processes.
method Decoupled learning method with two procedures: ADM-M and Fast ISTA, and a reformulated Logistic Regression model.
result Empirical results show the efficiency of the decoupled and reformulated method.
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.
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.
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.
New framework tackles fairness in link prediction beyond demographic parity.
problem Systemic biases in link prediction can exacerbate societal inequalities.
method Formalizes limitations of existing fairness evaluations and proposes a new framework.
result Proposes a lightweight post-processing method combined with decoupled link predictors.
A new method for training CNNs that decouples layer updates.
problem Update locking inefficiency in neural network training.
method Decoupled Greedy Learning (DGL) that relaxes joint training objective.
result DGL leads to better generalization than sequential greedy optimization.
Enhances RL with function approximation, improving regret bounds.
problem Improving exploration in reinforcement learning with function approximation.
method Prior-dependent Bayesian regret bound for PSRL with linear mixture MDPs, using value-targeted model learning and variance reduction.
result Established an upper bound of O ( d H 3 T log T ) {\mathcal{O}}(d\sqrt{H^3 T \log T}) O ( d H 3 T log T ) for PSRL. Tech sector decouples from non-tech sectors post-2015, predicting economic growth.
problem Understanding the relationship between technology and economic growth.
method ARIMA modeling, stationarity tests, data wrangling, exploratory data analysis.
result The technology sector decouples from non-technology sectors post-2015 and predicts economic growth.
A new loss function HUG decouples and generalizes neural collapse.
problem Neural collapse limits in deep learning models.
method Hyperspherical uniformity gap (HUG) as a unified framework.
result HUG decouples and generalizes neural collapse, improving model flexibility and robustness.
A new method for faster multi-objective optimization by evaluating objectives separately.
problem Finding the Pareto front of trade-offs between multiple objectives efficiently.
method Knowledge Gradient with decoupled evaluations, accounting for different costs.
result The method significantly outperforms existing approaches in terms of evaluation cost.
Study off-policy evaluation in partially observable environments, reducing bias and errors.
problem Bias and large errors in off-policy evaluation for partially observable environments.
method Defined and solved off-policy evaluation for POMDPs, introduced Decoupled POMDP model.
result Demonstrated and compared off-policy evaluation methods, showing benefits of new approach.
Unified stopping rules ensure accurate policies in contextual learning.
problem Stopping data collection to ensure accurate policies in personalized decision problems.
method Developed unified stopping rules based on GLR statistics for pairwise action comparisons.
result Unified stopping rules achieve target precision with fewer samples than benchmarks.