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

84167251334 · Jun 202019922001200920172026
48 results for target update frequency

This work analyzes how often to update the target network in Q-learning.

problem Understanding the optimal frequency of target network updates in Q-learning.
method Formulated target updates as a nested optimization scheme, derived finite-time convergence analysis.
result Optimal target update frequency increases geometrically over time.

In target tracking, the estimation of an unknown weaving target frequency is crucial for improving the miss distance. The estimation process is commonly carried out in a Kalman framework. The objective of this paper is to examine the potential of using neural networks in target tracking applications. To that end, we pr…

2018-06-13abs ↗pdf ↗

New measure of interference helps understand and mitigate learning issues in reinforcement learning.

problem Understanding and mitigating interference in reinforcement learning.
method Defined a new measure of interference, evaluated it, and identified key factors contributing to interference.
result Target network frequency and updates on the last layer are significant factors in interference.

In this paper, we address the fundamental problem of line spectral estimation in a Bayesian framework. We target model order and parameter estimation via variational inference in a probabilistic model in which the frequencies are continuous-valued, i.e., not restricted to a grid; and the coefficients are governed by a …

2016-04-13abs ↗pdf ↗

We develop a novel method for training of GANs for unsupervised and class conditional generation of images, called Linear Discriminant GAN (LD-GAN). The discriminator of an LD-GAN is trained to maximize the linear separability between distributions of hidden representations of generated and targeted samples, while the …

2017-07-25abs ↗pdf ↗

This paper analyzes how periodic and soft target updates stabilize linear Q-learning.

problem Theoretical explanation of stabilization mechanisms for linear Q-learning.
method Exact analysis using switched linear system dynamics and the joint spectral radius.
result Periodic and soft target updates can guarantee convergence to the exact projected Q-Bellman solution under specific conditions.

Newton's method converges faster than gradient descent in overparameterized neural networks.

problem Training neural networks efficiently in the overparameterized limit.
method Developed a convergence analysis for the regularized Newton method in this context.
result The NN training dynamics converge to the solution of a deterministic limit equation involving a Newton neural tangent kernel (NNTK).

FreSh shifts model's initial frequency spectrum to match target signal, improving neural representation performance.

problem MLPs' low-frequency bias limits capturing high-frequency details accurately.
method FreSh selects embedding hyperparameters to align model's initial output spectrum with target signal's spectrum.
result FreSh improves performance across various neural representation methods and tasks with minimal computational overhead.

A new update rule for deep reinforcement learning reduces learning variance and variance in reference signals.

problem Learning variance and incorrect reference signals in deep reinforcement learning.
method t-soft update method inspired by student-t distribution, which reduces extreme updates and accelerates similar updates.
result The t-soft update method outperforms conventional methods in terms of return and variance in PyBullet robotics simulations.

Paper proposes a DRL-based controller for networked AP systems that reduces communication frequency.

problem Reduce communication frequency in networked AP systems while maintaining control performance.
method Develops a DRL-based controller that avoids explicit update timing learning, using a semi-Markov decision process (SMDP).
result Improves communication efficiency without sacrificing control performance.

Microstructure of market dynamics is studied through analysis of tick price data. Linear trend is introduced as a tool for such analysis. Trend arbitrage inequality is developed and tested. The inequality sets limiting relationship between trend, bid-ask spread, market reaction and average update frequency of price inf…

2006-07-10abs ↗pdf ↗

FFN addresses spectral bias in neural value approximation, improving reinforcement learning performance.

problem Spectral bias in neural value approximation, leading to slow convergence and poor performance.
method Proposes Fourier feature networks (FFN) to overcome spectral bias by using a composite neural tangent kernel.
result FFN achieves state-of-the-art performance on challenging continuous control domains with faster convergence and better stability.

Motivated by recently published methods using frequency decompositions of convolutions (e.g. Octave Convolutions), we propose a novel convolution scheme to stabilize the training and reduce the likelihood of a mode collapse. The basic idea of our approach is to split convolutional filters into additive high and low fre…

2019-05-29abs ↗pdf ↗

For large scale on-line inference problems the update strategy is critical for performance. We derive an adaptive scan Gibbs sampler that optimizes the update frequency by selecting an optimum mini-batch size. We demonstrate performance of our adaptive batch-size Gibbs sampler by comparing it against the collapsed Gibb…

2018-01-27abs ↗pdf ↗

MPTE uses Transformer attention to estimate mixed-frequency factor models.

problem Estimating factor models in panel datasets with mixed frequencies and nonlinear signals.
method Mixed-Panels-Transformer Encoder (MPTE) with attention mechanisms.
result MPTE achieves competitive performance in nonlinear forecasting environments.

Radio frequency (RF) sensors are used alongside other sensing modalities to provide rich representations of the world. Given the high variability of complex-valued target responses, RF systems are susceptible to attacks masking true target characteristics from accurate identification. In this work, we evaluate differen…

2018-11-26abs ↗pdf ↗

Paper extends SI method for detecting CPs in complex systems' frequency domain.

problem Identifying change points in complex systems' frequency domain.
method Extends SI framework to frequency domain using DFT properties and develops valid p-values.
result Reliable detection of genuine CPs with strong statistical guarantees.

We study the problem of optimizing the betting frequency in a dynamic game setting using Kelly's celebrated expected logarithmic growth criterion as the performance metric. The game is defined by a sequence of bets with independent and identically distributed returns X(k). The bettor selects the fraction of wealth K wa…

2018-01-20abs ↗pdf ↗

Improved HGF networks avoid negative precision errors in volatility updates.

problem Negative posterior precision errors in volatility-coupled nodes of HGF networks.
method Introduced a modified quadratic approximation to variational energy.
result Robust update equations across parameter space that track posterior faithfully.

This work analyzes how frequency components affect CNN predictions and robustness.

problem Lack of frequency-based explanation for CNNs leading to vulnerabilities.
method Frequency component analysis and quantification of their contribution to CNN predictions.
result Adversarial attacks exploit high-frequency features, while robustness comes from low-frequency associations.

This paper investigates Shampoo's heuristics and decouples preconditioner updates.

problem Improving Shampoo's heuristics for training neural networks.
method Decomposing preconditioner updates, correcting eigenvalues, and adapting eigenbasis computation frequency.
result Principled techniques to remove Shampoo's heuristics and improve training algorithms.

Deeper neural networks learn lower frequency functions faster, according to a new principle.

problem Understanding why deeper learning is faster.
method Fourier analysis and filtering method to separate and analyze the frequency distribution of neural network outputs.
result Deeper hidden layers in neural networks bias towards lower frequency functions during training.

Federated learning systems are vulnerable to attacks from malicious clients. As the central server in the system cannot govern the behaviors of the clients, a rogue client may initiate an attack by sending malicious model updates to the server, so as to degrade the learning performance or enforce targeted model poisoni…

2020-02-01abs ↗pdf ↗

In this paper, we propose a method for training neural networks when we have a large set of data with weak labels and a small amount of data with true labels. In our proposed model, we train two neural networks: a target network, the learner and a confidence network, the meta-learner. The target network is optimized to…

2017-11-30abs ↗pdf ↗

AI traders learn to exploit meta-orders from slower traders, increasing their profits.

problem Adverse selection of medium-frequency traders by high-frequency AI agents.
method Reinforcement learning in a Hawkes LOB model, with impulse control and PPO.
result AI agents can learn to capitalize on meta-orders, increasing their profits.

Muon outperforms GD in associative memory learning by balancing frequency components.

problem Training dynamics and scaling behavior of Muon in associative memory learning.
method Study of Muon in a linear associative memory model with softmax retrieval and hierarchical frequency spectrum over query-answer pairs.
result Muon achieves exponential speedup over GD in noiseless case and superior scaling efficiency in noisy case.

Paper tackles joint community detection and phase synchronization in stochastic block models.

problem Jointly recover cluster structure and phase angles in stochastic block models.
method Proposes two algorithms: a spectral method based on multi-frequency QR factorization and an iterative multi-frequency generalized power method.
result Proposed algorithms significantly improve recovery of cluster structure and phase angles compared to existing methods.

EGMU optimizes portfolios using KL divergence, ensuring positive solutions.

problem Constructing multi-factor target-exposure portfolios efficiently and accurately.
method Convex optimization framework minimizing KL divergence, with explicit solvers.
result Established feasibility and uniqueness of strictly positive solutions under convex-hull conditions.

GAIT-prop derives a biologically plausible learning rule from backpropagation.

problem Biological implausibility in traditional backpropagation for neural networks.
method GAIT-prop uses a top-down model to convert output error into plausible targets for weight updates.
result GAIT-prop and backpropagation give identical weight updates under certain conditions.

This study proposes a trainable adaptive window switching (AWS) method and apply it to a deep-neural-network (DNN) for speech enhancement in the modified discrete cosine transform domain. Time-frequency (T-F) mask processing in the short-time Fourier transform (STFT)-domain is a typical speech enhancement method. To re…

2018-11-05abs ↗pdf ↗