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

22436586 · Jun 202019922001200920172026
48 results for Decoupled Bandits

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.

FGTSVA improves Thompson Sampling for contextual bandits with optimal variance-aware regret.

problem Optimizing regret bounds for Thompson Sampling in contextual bandits.
method Developed FGTSVA, a variance-aware Thompson Sampling algorithm for contextual bandits with a new decoupling coefficient.
result Achieved optimal regret bound of ildeO(dclogFt=1Tσt2+dc) ilde{O}(\sqrt{\mathrm{dc}\cdot\log|\mathcal{F}|\sum_{t=1}^Tσ_t^2}+\mathrm{dc}).

Study on indexability of restless multi-armed bandits and rollout policy performance.

problem Maximizing discounted rewards in finite state restless multi-armed bandit problems.
method Decouple the problem into single-armed restless bandits, analyze using value iteration, and compare with Whittle index policy.
result Demonstrates conditions for indexability and compares performance of index policy and rollout policy.

Study on information evolution in interactive decision making using multi-armed bandits.

problem Understanding information dynamics in interactive decision making.
method Stochastic multi-armed bandit problem, focusing on optimal arm with a fixed margin.
result Distinct growth phases in mutual information, showing decoupling between success probability and information gain.

Unified framework controls false discovery rate in bandit multiple testing.

problem Designing adaptive algorithms to identify true discoveries in multiple hypothesis testing.
method Unified modular framework using e-processes for FDR control in arbitrary settings.
result Unified framework ensures FDR control for dependent and simultaneous arm queries.

Improved FTRL algorithm for multi-armed bandits with various regularizers and multiple optimal arms.

problem Designing adaptive multi-armed bandit algorithms that perform optimally in both stochastic and adversarial settings.
method Follow-the-Regularized-Leader (FTRL) algorithm with a broad family of regularizers and a new learning rate schedule.
result Uniqueness of optimal arm assumption is unnecessary for FTRL with a broad family of regularizers.

Asymptotically optimal algorithm for contextual linear bandits.

problem Contextual linear bandits with suboptimal algorithms.
method Decoupling context distribution and exploration policy, incremental primal-dual approach, confidence intervals.
result Asymptotic optimality and scalability of the algorithm.

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 ↗

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.

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.

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 ↗

Optimization is commonly employed to determine the content of web pages, such as to maximize conversions on landing pages or click-through rates on search engine result pages. Often the layout of these pages can be decoupled into several separate decisions. For example, the composition of a landing page may involve dec…

2018-10-22abs ↗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 ↗

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 algorithms for fast online decision making using neural networks and martingale posteriors.

problem Online sequential decision making under uncertainty.
method Martingale posterior neural networks for fast online learning and decision making.
result Achieves competitive performance-speed trade-offs in non-stationary contextual bandits and Bayesian optimization.

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.

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.

Gaussian processes (GPs) provide a powerful non-parametric framework for reasoning over functions. Despite appealing theory, its superlinear computational and memory complexities have presented a long-standing challenge. State-of-the-art sparse variational inference methods trade modeling accuracy against complexity. H…

2018-09-24abs ↗pdf ↗

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 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.

Capacity analysis has been recently introduced as a way to analyze how linear models distribute their modelling capacity across the input space. In this paper, we extend the notion of capacity allocation to the case of neural networks with non-linear layers. We show that under some hypotheses the problem is equivalent …

2019-02-22abs ↗pdf ↗