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,694 papers · 148 categories

Trend · papers per month

2579 · Jun 202019922001200920172026
48 results for Closed-Loop Recycling

Paper predicts recycling bin full events to reduce RVM downtime.

problem Predicting bin full events to increase RVM uptime.
method Hybrid approach combining machine learning and statistical approximation.
result Forecasting leads to less downtime and costs compared to emptying strategies.

A new method prioritizes and recycles experiences for better reinforcement learning.

problem Improving reinforcement learning efficiency by prioritizing and recycling experiences.
method Double-prioritized state-recycled (DPSR) experience replay.
result DPSR achieved state-of-the-art results in Atari games, outperforming original and prioritized methods.

The paper analyzes debt recycling strategies for mortgage repayment, revealing complex phases of success and failure.

problem Evaluating the effectiveness of debt recycling strategies compared to standard mortgage repayment.
method Developed a dynamical model to study the time evolution of equity and mortgage balance under various conditions.
result The model identifies four phases: strongly successful, weakly successful, default, and permanent re-mortgaging, with sensitivity to initial conditions.

Model analyzes debt recycling strategies under various fiscal regimes and jurisdictions.

problem Understanding debt recycling dynamics and their impact on repayment times and equity growth.
method Developed a calibrated model incorporating mortgage interest rates, borrowing costs, and tax shields.
result Introducing positive interest rates without tax shields contracts success regions and lengthens repayment times, but tax shields partially reverse these effects.

Framework learns robust control policies from expert demonstrations.

problem Adversarial robustness and closed-loop generalization in feedback control policies.
method Lipschitz-constrained loss minimization for certified robustness and generalization.
result Finite sample bound on policy learning error and robust closed-loop stability.

Paper proposes recycling model updates in federated learning by exploiting low-rank gradient subspaces.

problem Large parameter transmissions in federated learning.
method Look-back Gradient Multiplier (LBGM) algorithm exploiting low-rank property of gradient subspaces.
result LBGM reduces communication overhead with minimal performance loss.

A new method for efficient nested Monte Carlo simulations in financial modeling.

problem Computational challenges in nested stochastic modeling for financial risk assessment.
method Sample recycling approach to speed up inner loop estimations.
result Significantly more efficient than traditional techniques.

Study on parameter dynamics in exponential families under closed-loop learning.

problem Understanding and preventing convergence to biased absorbing states in model parameter estimation.
method Derived equations of motion for parameter dynamics in exponential families. Showed convergence to biased states under maximum likelihood estimation and proposed solutions.
result Closed-loop learning can lead to biased parameter estimates, but can be mitigated by using maximum a posteriori estimation or regularisation.

Geometrically characterizes virtual nonlinear nonholonomic constraints using symplectic methods.

problem Characterizing virtual nonlinear nonholonomic constraints geometrically.
method Geometric characterization using symplectic structures and Chetaev equations.
result A unique control law exists to satisfy virtual constraints, and closed-loop dynamics are projections of uncontrolled dynamics.

Formula adjusts steady-state models for control confounding.

problem Learning steady-state models from operational data can be flawed due to control confounding.
method Derives a formula to adjust for control confounding using structural dynamical causal models.
result Estimates a causal steady-state model from closed-loop operational data.

Monte Carlo methods are essential tools for Bayesian inference. Gibbs sampling is a well-known Markov chain Monte Carlo (MCMC) algorithm, extensively used in signal processing, machine learning, and statistics, employed to draw samples from complicated high-dimensional posterior distributions. The key point for the suc…

2016-11-21abs ↗pdf ↗

Data-efficient learning in continuous state-action spaces using very high-dimensional observations remains a key challenge in developing fully autonomous systems. In this paper, we consider one instance of this challenge, the pixels to torques problem, where an agent must learn a closed-loop control policy from pixel i…

2015-02-08abs ↗pdf ↗

This work improves testing of machine learning model modifications using novel statistical methods.

problem Overfitting and conservative Bonferroni correction when testing multiple model modifications.
method Introduces alpha-recycling and SRGPs to control error rate and approve more beneficial modifications.
result Novel statistical methods approve a higher number of beneficial modifications than previous approaches.

This work discusses a closed-loop control strategy for complex systems utilizing scarce and streaming data. A discrete embedding space is first built using hash functions applied to the sensor measurements from which a Markov process model is derived, approximating the complex system's dynamics. A control strategy is t…

2016-04-11abs ↗pdf ↗

This paper uses NLDT to find interpretable control rules from complex DRL policies.

problem Complex, non-interpretable policies from black-box AI methods.
method Evolutionary optimization of NLDT for hierarchical control rules.
result Interpretable control rules with similar performance to black-box DRL.

Contrary to the situation with stochastic gradient descent, we argue that when using stochastic methods with variance reduction, such as SDCA, SAG or SVRG, as well as their variants, it could be beneficial to reuse previously used samples instead of fresh samples, even when fresh samples are available. We demonstrate t…

2016-02-05abs ↗pdf ↗

CLQT benchmarks LLM portfolio managers by evaluating their decision-making process, not just returns.

problem Most benchmarks rank LLMs by returns, ignoring their decision-making process and potential for look-ahead leakage.
method CLQT reframes evaluation as diagnosis, using a closed-loop, cost-aware, strategy-consistent environment with a five-stage cycle.
result CLQT provides a durable map of agent competencies and limitations, separating outcome from process.

Analyzes how learning algorithms affect and are affected by data manipulation.

problem Characterizing the closed-loop behavior of learning algorithms in the presence of decision-dependent data.
method Analyzes repeated risk minimization as perturbed gradient flows of performative risk minimization, considering multiple local minimizers.
result Characterizes the region of attraction for various equilibria and introduces performative alignment.

DQN outperforms static policies in a dynamic fee environment for automated market makers.

problem How automated market makers (AMMs) perform under dynamic fees is unknown.
method Constructed a closed-loop simulator with dynamic fees, noise flow, and arbitrage.
result A small DQN policy outperforms static policies in a dynamic fee environment.

NAPP-ERM improves ERM with differential privacy guarantees by iteratively achieving target regularization and delivering strong convexity.

problem Over-regularization in privacy-preserving ERM approaches.
method Noise-Augmented Privacy-Preserving Empirical Risk Minimization (NAPP-ERM) with a dual-purpose l2 regularizer and privacy budget retrieval strategy.
result Mitigates over-regularization and achieves strong convexity through a single regularizer.

Paper tackles stochastic control with mean and higher-order moments, finding Nash equilibria.

problem Time-inconsistent stochastic control problems with mean and higher-order moments.
method Developed closed-loop and open-loop Nash equilibrium controls using PDEs and maximum principles.
result Identical closed-loop and open-loop Nash equilibria controls, independent of state value and random path.

A geometric approach to differential game theory is illustrated. The parallel pursuit is considered as a two-player zero-sum differential game. The optimal strategies of each player is designed based on Riemann-Finsler geometry. Our approach incorporates a closed loop optimal control and the presentation is familiar wi…

2011-01-10abs ↗pdf ↗

Every production-recycling iteration accumulates an inevitable proportion of its matter-energy in the environment, lest the production process itself would be a system in perpetual motion, violating the second law of Thermodynamics. Such high-entropy matter depletes finite stocks of ecosystem services provided by the e…

2013-09-09abs ↗pdf ↗

New budget quantifies drift in closed-loop learning, improving reproducibility.

problem Characterizing statistical learning under distributional drift in closed-loop settings.
method Introduces an intrinsic drift budget CTC_T quantifying cumulative information-geometric motion of the data distribution.
result Proves a drift-feedback bound of order T1/2+CT/TT^{-1/2}+C_T/T for prequential reproducibility, up to controlled second-order remainder terms.

We present an alternative local definition of the writhe of a self-avoiding closed loop which differs from the traditional non-local definition by an integer. When studying dynamics this difference is immaterial. We employ a formula due to Aldinger, Klapper and Tabor for the change in writhe and propose a set of local,…

1997-03-13abs ↗pdf ↗

The paper tackles performative risk optimization under weak convexity assumptions.

problem Optimizing performative risk in a closed-loop prediction system with weak convexity.
method Relaxing convexity assumptions to maintain optimization feasibility.
result Iterative optimization methods remain applicable even with weakened convexity conditions.

Filling length measures the length of the contracting closed loops in a null-homotopy. The filling length function of Gromov for a finitely presented group measures the filling length as a function of length of edge-loops in the Cayley 2-complex. We give a bound on the filling length function in terms of the log of an …

2000-08-03abs ↗pdf ↗

Sequential learning of tasks using gradient descent leads to an unremitting decline in the accuracy of tasks for which training data is no longer available, termed catastrophic forgetting. Generative models have been explored as a means to approximate the distribution of old tasks and bypass storage of real data. Here …

2018-11-03abs ↗pdf ↗

Combines Gaussian processes and polynomial chaos for stochastic control.

problem Uncertainties in dynamic models lead to performance issues in predictive control.
method Combines Gaussian processes with polynomial chaos expansions to estimate probability distributions of nonlinear functions.
result Demonstrates accurate approximation and closed-loop performance in stochastic nonlinear model predictive control.