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.
R package psvmSDR simplifies SDR computation for machine learning.
Collaborative filtering, especially latent factor model, has been popularly used in personalized recommendation. Latent factor model aims to learn user and item latent factors from user-item historic behaviors. To apply it into real big data scenarios, efficiency becomes the first concern, including offline model train…
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…
Detecting real-time price impact in algo trading
Reinforcement learning is explored as a candidate machine learning technique to enhance existing analytical solutions for optimal trade execution with elements from the market microstructure. Given a volume-to-trade, fixed time horizon and discrete trading periods, the aim is to adapt a given volume trajectory such tha…
Random features enhance control of complex systems.
VoiceFilter-Lite separates speech from background in real-time for on-device speech recognition.
Neuromorphic column performs online unsupervised clustering.
We postulates, and then show experimentally, that liquidity deficit is the driving force of the markets. In the first part of the paper a kinematic of liquidity deficit is developed. The calculus-like approach, which is based on Radon--Nikodym derivatives and their generalization, allows us to calculate important chara…
The fashion industry is establishing its presence on a number of visual-centric social media like Instagram. This creates an interesting clash as fashion brands that have traditionally practiced highly creative and editorialized image marketing now have to engage with people on the platform that epitomizes impromptu, r…
AI enhances bank credit risk management through deep learning and data analysis.
System uses machine learning and automated reasoning to speed up PBE synthesis.
Paper proposes efficient weight updates for edge nodes with minimal communication.
Motivated by the practical challenge in monitoring the performance of a large number of algorithmic trading orders, this paper provides a methodology that leads to automatic discovery of the causes that lie behind a poor trading performance. It also gives theoretical foundations to a generic framework for real-time tra…
A new update rule for deep reinforcement learning reduces learning variance and variance in reference signals.
Paper proves Jeffrey's update rule minimizes relative entropy.
AMUSE uses reinforcement learning to predict optimal model updates.
We shed new insights on the two commonly used updates for the online -PCA problem, namely, Krasulina's and Oja's updates. We show that Krasulina's update corresponds to a projected gradient descent step on the Stiefel manifold of the orthonormal -frames, while Oja's update amounts to a gradient descent step using…
Efficiently updates posterior tree distributions over meta-trees.
Recently, the technique of local updates is a powerful tool in centralized settings to improve communication efficiency via periodical communication. For decentralized settings, it is still unclear how to efficiently combine local updates and decentralized communication. In this work, we propose an algorithm named as L…
The paper examines how updates to probabilistic models influence behavior based on evidence.
Paper improves policy updates in reinforcement learning to speed up learning.
In this paper, we study the randomized distributed coordinate descent algorithm with quantized updates. In the literature, the iteration complexity of the randomized distributed coordinate descent algorithm has been characterized under the assumption that machines can exchange updates with an infinite precision. We con…
Proposes a new method for nonlinear Bayesian updates using ensemble kernel regression.
This paper analyzes how periodic and soft target updates stabilize linear Q-learning.
In this letter, we generalize the convolutional NMF by taking the -divergence as the contrast function and present the correct multiplicative updates for its factors in closed form. The new updates unify the -NMF and the convolutional NMF. We state why almost all of the existing updates are inexact and approximat…
EnKF's update is shown to be similar to Matheron's method in Gaussian process regression.
Improved HGF networks avoid negative precision errors in volatility updates.
Federated learning is a distributed learning method to train a shared model by aggregating the locally-computed gradient updates. In federated learning, bandwidth and privacy are two main concerns of gradient updates transmission. This paper proposes an end-to-end encrypted neural network for gradient updates transmiss…
A new method extracts features and reconstructs moments in dynamical systems using information geometry.
Algorithm estimates bounds of updated classifier coefficients efficiently.
Develops efficient method for updating models with small data changes.
GANs excel at learning high dimensional distributions, but they can update generator parameters in directions that do not correspond to the steepest descent direction of the objective. Prominent examples of problematic update directions include those used in both Goodfellow's original GAN and the WGAN-GP. To formally d…
A new method improves few-shot image classification by updating top layers.
A new method for efficient neural network fine-tuning using queryable low-rank update atoms.
Study examines auditing fairness in evolving models, identifying strategic updates that preserve audit properties.
Drop-Muon updates only some layers, speeding up training.
Most of real-world graphs are dynamic, i.e., they change over time by a sequence of update operations. While the regression problem has been studied for static graphs and temporal graphs, it is not investigated for general dynamic graphs. In this paper, we study regression over dynamic graphs. First, we present the not…
This work analyzes how often to update the target network in Q-learning.
In this paper, we extend the -CNMF to two dimensions and derive exact multiplicative updates for its factors. The new updates generalize and correct the nonnegative matrix factor deconvolution previously proposed by Schmidt and Mørup. We show by simulation that the updates lead to a monotonically decreasing -dive…
In this paper, we present a novel approach for fine-tuning a decoder-side neural network in the context of image compression, such that the weight-updates are better compressible. At encoder side, we fine-tune a pre-trained artifact removal network on target data by using a compression objective applied on the weight-u…
Framework for safely updating machine learning models.
Reparameterizes mirror descent as gradient descent for efficient sparse learning.
The (stochastic) gradient descent and the multiplicative update method are probably the most popular algorithms in machine learning. We introduce and study a new regularization which provides a unification of the additive and multiplicative updates. This regularization is derived from an hyperbolic analogue of the entr…
A new graph neural network (NBA-GNN) avoids revisiting nodes to improve accuracy.
FedLoRU improves FL efficiency by using low-rank updates.
Many policy gradient methods are variants of Actor-Critic (AC), where a value function (critic) is learned to facilitate updating the parameterized policy (actor). The update to the actor involves a log-likelihood update weighted by the action-values, with the addition of entropy regularization for soft variants. In th…
Paper analyzes ensemble Kalman updates for effective dimension and localization.