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

Trend · papers per month

21436485 · Jun 202019922001200920172026
48 results for static feedback

Paper shows how to linearize flat systems with two inputs.

problem Linearizing flat nonlinear control systems with two inputs.
method Using prolongations of a control, the system can be made static feedback linearizable.
result A tracking control can be designed without requiring measurements of a generalized Brunovsky state.

Paper presents a new flat triangular form for systems.

problem Creating a structurally flat triangular form for systems.
method Developed a new triangular form based on the extended chained form with conditions for static feedback equivalence.
result Provided conditions for affine input systems to be static feedback equivalent to the new triangular form.

The paper studies symmetry reduction of control systems and its implications for feedback linearization.

problem Understanding symmetry reduction and its effects on feedback linearizability of control systems.
method Generalizing the notion of transversality of Lie group actions, analyzing the geometry of invariant distributions, and extending the S-G-S test.
result Classification of SFL quotients based on geometric properties of the control system and symmetry group.

New framework solves dynamic bilevel optimization problems in reinforcement learning.

problem Dynamic objective functions in reinforcement learning and human feedback.
method Principled penalty-based methods for bilevel reinforcement learning.
result Demonstrated effectiveness of penalty-based algorithms in simulations.

The paper tackles exact linearization and control of flat discrete-time systems.

problem Exact linearization and control of flat nonlinear discrete-time systems.
method Investigates conditions for choosing new inputs and feedbacks that may depend on forward-shifts of the new input.
result Easily verifiable conditions for choosing a feasible input and a new input that minimizes forward-shifts of the flat output.

Unified framework for analyzing online convex optimization across various settings.

problem Analyzing online convex optimization in different settings and feedback types.
method Unified framework allowing systematic proposal and analysis of meta-algorithms.
result Comparable regret bounds for various feedback types and adversary types.

New research shows fixed-budget best-arm identification cannot match static oracle performance.

problem Fixed-budget best-arm identification's performance limitations.
method Analysis of various adaptive and static algorithms for best-arm identification.
result For any algorithm, there exists at least one instance where the error decay rate is at most \((1 + \frac{\log(K)}{8})^{-1}\) times that of the static oracle.

New method tackles online DR-submodular maximization with improved regret guarantees.

problem Online maximization of non-monotone DR-submodular functions over down-closed convex sets.
method 1/e-linearization through exponential reparametrization, surrogate potential, and reduction to online linear optimization.
result Achieves O(T1/2)O(T^{1/2}) static regret with single gradient query per round, improving state of the art.

This paper extends a Kyle model to include price-responsive traders, revealing new dynamics and equilibria.

problem Real-world market dynamics involve price-responsive traders, affecting market equilibrium and insider profits.
method Developed a continuous-time Kyle model with two types of price-responsive traders (momentum and contrarian), leading to a forward-backward Riccati system for equilibrium.
result The model shows that feedback effects can lead to multiple equilibria and amplify price informativeness.

We show that the flatness of a nonlinear discrete-time system can be checked by computing a unique sequence of involutive distributions. The well-known test for static feedback linearizability is included as a special case. Since the computation of the sequence of distributions requires only the solution of algebraic e…

2019-09-04abs ↗pdf ↗

New algorithm reduces dynamic regret in time-varying movement costs.

problem Dynamic regret in online convex optimization with time-varying movement costs.
method Introduced a novel algorithm for time-varying movement costs, achieving comparator-adaptive dynamic regret bound.
result Established first comparator-adaptive dynamic regret bound of O~((M2+MPT)(T+tλt))\widetilde{\mathcal{O}}(\sqrt{(M^2+MP_T)(T+\sum_t λ_t)}).

Survey explores geometric aspects of policy optimization in control systems.

problem Understanding the geometric relationships between control design and optimization.
method Geometric perspective on policy optimization, focusing on parameterization and topology.
result Implications of policy geometry on stability and performance of local search algorithms.

New method prevents RLHF alignment collapse by accounting for policy's influence on reward model updates.

problem Iterative RLHF leads to alignment collapse where policies exploit RM's blind spots.
method Foresighted policy optimization (FPO) restores missing steering term via regularization.
result FPO prevents alignment collapse on LLM alignment pipelines using Llama-3.2-1B.

Fairness in machine learning has predominantly been studied in static classification settings without concern for how decisions change the underlying population over time. Conventional wisdom suggests that fairness criteria promote the long-term well-being of those groups they aim to protect. We study how static fairne…

2018-03-12abs ↗pdf ↗

A trading system uses LLMs to adapt to volatile crypto markets.

problem Volatility and market sentiment in cryptocurrencies make traditional models ineffective.
method Specialized LLM agents for technical analysis, sentiment evaluation, and decision-making; verbal feedback for continuous improvement.
result Agents outperform buy-and-hold strategy with consistent gains across market phases.

Adaptive RL optimizes testing resource allocation for dynamic software environments.

problem Optimizing resource allocation for evolving software testing environments.
method Integrates Q-learning with hybrid reward design for sequential decision-making.
result Consistently outperforms static and optimization-based baselines in simulation studies.

In this paper we experimentally analyze the convergence behavior of CoCoA and show, that the number of workers required to achieve the highest convergence rate at any point in time, changes over the course of the training. Based on this observation, we build Chicle, an elastic framework that dynamically adjusts the num…

2018-11-06abs ↗pdf ↗

Advanced and effective collaborative filtering methods based on explicit feedback assume that unknown ratings do not follow the same model as the observed ones (\emph{not missing at random}). In this work, we build on this assumption, and introduce a novel dynamic matrix factorization framework that allows to set an ex…

2015-07-23abs ↗pdf ↗

Study classifies static potentials on 3-manifolds, proving one-dimensionality under specific conditions.

problem Classifying the dimension of static potentials on 3-manifolds.
method Analysis of relative zero sets of static potentials, using Miao and Tam's technique.
result Proves one-dimensionality of static potentials under specific conditions.

Two algorithms for linear contextual bandits with rare updates achieve optimal regret and efficiency.

problem Linear contextual bandits with infrequent parameter updates.
method Two practical algorithms with O(loglogT)O(\log\log T) updates, BLCE-G and BLCE.
result Minimax-optimal regret with low computational complexity.

New static vacuum metrics confirmed for near Euclidean boundary data.

problem Establishing sufficient conditions for near Euclidean boundary data in static vacuum metrics.
method Using new arguments from studying the conjecture for arbitrary static vacuum metrics.
result Any hypersurface in a dense subfamily is static regular.

Dynamic VWAP execution improves by 10-15% in liquid markets.

problem Improving VWAP execution in dynamic markets.
method Recurrent Neural Networks (RNNs) for capturing temporal market dynamics, dynamic adjustment mechanism.
result Significant performance gains in liquid markets (10-15%) over traditional methods.

Extends static vacuum metrics with specific boundary conditions.

problem Proving the existence of static vacuum metrics with prescribed boundary data.
method Introducing static regular types (I) and (II), showing local well-posedness, and confirming Bartnik's conjecture.
result Confirms Bartnik's static vacuum extension conjecture for a broad range of boundary conditions.

Analysis of deep neural networks under various learning rules reveals dynamics of feature and prediction learning.

problem Understanding how different learning rules affect feature and prediction dynamics in deep neural networks.
method Analysis of infinite-width deep networks trained with gradient descent and various learning rules.
result The evolution of the output function is governed by an effective neural tangent kernel (eNTK), which varies depending on the learning rule and training regime.

We classify static manifolds which admit more than one static decomposition whenever a condition on the curvature is fullfilled. For this, we take a standard static vector field and analyze its associated one parameter family of projections onto the base. We show that the base itself is a static manifold and the warpin…

2009-10-26abs ↗pdf ↗

Geometric inequalities for static convex domains in hyperbolic space proved.

problem Proving geometric inequalities for static convex domains in hyperbolic space.
method Using static convexity of flow hypersurfaces, new inequalities are derived.
result New family of geometric inequalities for static convex domains in hyperbolic space.

The paper classifies vacuum static spaces with harmonic curvature.

problem Classifying vacuum static spaces with harmonic curvature.
method Extending the 4-dimensional work by Kim-Shin, the paper classifies nn-dimensional spaces (n5n\geq 5).
result New counterexamples to the Fischer-Marsden conjecture on compact vacuum static spaces.

The paper investigates geometrical aspects of static spacetime with almost gradient Ricci solitons.

problem Geometrical properties of static spacetime with almost gradient Ricci solitons.
method Analyzing conditions and properties of static spacetime with almost gradient Ricci solitons.
result Conditions and properties of static spacetime with almost gradient Ricci solitons are determined.

The study proves geometric inequalities for static convex domains in static rotationally symmetric spaces.

problem Proving geometric inequalities for static convex domains in static rotationally symmetric spaces.
method Locally constrained curvature flow in a static rotationally symmetric space Nn+1\mathbf{N}^{n+1}, proving graphical solutions and static convexity preservation.
result Proves weighted geometric inequalities for static convex domains close to a slice of Nn+1\mathbf{N}^{n+1}.

We consider Killing vector fields on standard static space-times and obtain equations for a vector field on a standard static space-time to be Killing. We also provide a characterization of Killing vector fields on standard static space-times with compact Riemannian parts.

2008-01-30abs ↗pdf ↗

We consider a continuous-time financial market that consists of securities available for dynamic trading, and securities only available for static trading. We work in a robust framework where a set of non-dominated models is given. The concept of semi-static completeness is introduced: it corresponds to having exact re…

2015-10-07abs ↗pdf ↗