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

Trend · papers per month

471114 · Apr 202619922001200920172026
48 results for steering wheel

A novel controller for wheeled robots handles joystick inputs for smooth steering.

problem Steering control for differential-drive wheeled robots from indirect joystick inputs.
method Developed a geometric controller based on Darboux frame kinematics.
result Smooth trajectories achieved with safety constraints and no desired states.

New model for visual cortex border completion using bicycle wheel motions.

problem Understanding border completion in the visual cortex V1.
method Sub-Riemannian Hamiltonian formalism and bicycle wheel analogy.
result Analogies between visual cortex border completion and bicycle wheel motions.

The paper computes groups and modules for wheel graphs using Fibonacci and Chebyshev polynomials.

problem Computing groups and modules for wheel graphs.
method Utilized Fibonacci and Chebyshev polynomials to compute the Reduced Fox Coloring Group and Alexander-Burau-Fox Module.
result Computed groups and modules for wheel graphs using Fibonacci and Chebyshev polynomials.

The purpose of this research paper it is to present a new approach in the framework of a biased roulette wheel. It is used the approach of a quantitative trading strategy, commonly used in quantitative finance, in order to assess the profitability of the strategy in the short term. The tools of backtesting and walk-for…

2016-09-30abs ↗pdf ↗

Paper introduces exact credible sets for classification problems.

problem No general way to construct exact credible sets for classification.
method Generalized credible set with connection to Neyman--Pearson lemma and randomized decision rule.
result Achieves any preassigned credible level for classification problems.

In a previous paper, we generalized the definition of the framed Kontsevich integral initially presented by Le and Murakami. We also defined an isotopy invariant Z~f\widetilde{Z}_f that is well-behaved under band sum moves. Using this invariant we study the construction of the LMO invariant, the Wheeling Theorem, and th…

2010-10-13abs ↗pdf ↗

We study the unwheeled rational Kontsevich integral of torus knots. We give a precise formula for these invariants up to loop degree 3 and show that they appear as colorings of simple diagrams. We show that they behave under cyclic branched coverings in a very simple way. Our proof is combinatorial: it uses the results…

2003-10-08abs ↗pdf ↗

Using technique of wheeled props we establish a correspondence between the homotopy theory of unimodular Lie 1-bialgebras and the famous Batalin-Vilkovisky formalism. Solutions of the so called quantum master equation satisfying certain boundary conditions are proven to be in 1-1 correspondence with representations of …

2008-04-15abs ↗pdf ↗

We study the rational Kontsevich integral of torus knots. We construct explicitely a series of diagrams made of circles joined together in a tree-like fashion and colored by some special rational functions. We show that this series codes exactly the unwheeled rational Kontsevich integral of torus knots, and that it beh…

2004-04-14abs ↗pdf ↗

We express characteristic numbers of compact hyperkähler manifolds in graph-theoretical form, considering them as a special case of the curvature invariants introduced by Rozansky and Witten. The appropriate graphs are generated by ``wheels'' and we use the recently proved Wheeling Theorem to give a formula for the L2 …

1999-08-20abs ↗pdf ↗

New analysis shows interpretability doesn't guarantee steering utility in LLMs.

problem Does higher interpretability lead to better steering utility in large language models?
method Trained 90 SAEs across three LLMs, evaluated interpretability and steering utility, used Kendall's rank coefficients for analysis.
result Interpretability is only weakly associated with steering utility, and features selected by Delta Token Confidence improve steering performance.

Study designs incentives for adapting multi-agent systems without knowing their learning dynamics.

problem Designing incentives for an adapting population in multi-agent systems without prior knowledge of their learning dynamics.
method Introduces a model-based non-episodic Reinforcement Learning (RL) formulation for steering Markovian agents towards desired policies, focusing on history-dependent strategies to handle model uncertainty.
result Identifies conditions for the existence of steering strategies to guide agents to desired policies and provides empirical algorithms to approximately solve the objective.

We show LLMs can be locally linear, enabling better control of activations.

problem Suboptimal control of LLM activations during generation.
method Model LLM inference as a linear dynamical system, compute feedback controllers using Jacobians, and adapt classical control theory.
result Robust, fine-grained control of LLM activations across models and tasks.

Study designs steering rewards for MFGs with unknown dynamics and model uncertainty.

problem Designing incentives for large populations of agents in MFGs with uncertain model details.
method Developed optimistic exploration algorithms for agents with no-adaptive regret behaviors.
result Sub-linear regret guarantees for cumulative gaps between agent behaviors and desired outcomes.

The complement of a non-separating planar graph contains a K_n minor.

problem Characterizing the structure of complements of planar graphs.
method Analyzing the structure of complements of non-separating planar graphs and using examples to illustrate hypotheses.
result The order 2n-3 is the lowest possible for a non-separating planar graph whose complement contains a K_n minor.

The paper explores how AI systems use information geometry to encode semantic structure.

problem How AI systems encode semantic structure into geometric representation spaces.
method Focuses on softmax distributions and develops dual steering method for robust concept manipulation.
result Dual steering optimally modifies target concepts while minimizing off-target changes.

We write a formula for the LMO invariant of a rational homology sphere presented as a rational surgery on a link in S^3. Our main tool is a careful use of the Aarhus integral and the (now proven) "Wheels" and "Wheeling" conjectures of B-N, Garoufalidis, Rozansky and Thurston. As steps, side benefits and asides we give …

2000-07-07abs ↗pdf ↗

Painless Activation Steering automates post-training for LMs without manual intervention.

problem Manual post-training methods are time-consuming and labor-intensive.
method Painless Activation Steering (PAS) is a fully automated approach that requires no manual intervention.
result PAS reliably improves performance for behavior tasks but not for intelligence-oriented tasks.

This research tackles balancing exploration and exploitation in deep RL for partially observable systems.

problem Balancing exploration and exploitation in deep RL for partially observable systems.
method Deployed and tested several techniques including adaptive and deterministic exploration strategies, and a modified quadratic loss function.
result Adaptive methods better approximate the trade-off between exploration and exploitation.

Solves steering problem with continuous time, Hilbert-Schmidt cost, and matrix ODEs.

problem Fixed horizon linear quadratic covariance steering in continuous time with a specific terminal cost.
method Formulates necessary conditions as a coupled matrix ODE two-point boundary value problem, designs a matricial recursive algorithm, and proves convergence.
result Proposes and proves the convergence of a matricial recursive algorithm for solving the steering problem.

Interactive steering improves hierarchical clustering for diverse user needs.

problem Existing hierarchical clustering methods fail to meet diverse user needs.
method Knowledge-driven and data-driven constraints, interactive steering through a visual interface.
result Facilitates the building of customized clustering trees efficiently and effectively.

We recall the construction of the Kontsevich graph orientation morphism γOr(γ)γ\mapsto {\rm O\vec{r}}(γ) which maps cocycles γγ in the non-oriented graph complex to infinitesimal symmetries P˙=Or(γ)(P)\dot{\mathcal{P}} = {\rm O\vec{r}}(γ)(\mathcal{P}) of Poisson bi-vectors on affine manifolds. We reveal in particular why there alw…

2018-11-19abs ↗pdf ↗

This paper improves model training by using a reference model to guide target model training.

problem Improving generalization and data efficiency in model training.
method DRRho risk minimization framework based on Distributionally Robust Optimization (DRO).
result DRRho risk minimization improves generalization and data efficiency compared to training without a reference model.

A new method for steering large agent populations efficiently.

problem Controlling the configuration of a swarm of identical, interacting cooperative agents.
method Mean-Field Schrodinger Bridges with Gaussian Mixture Models.
result A highly efficient parameterization to approximate optimal solutions of the MFSB problem in closed form.

Model-free reinforcement learning has recently been shown to successfully learn navigation policies from raw sensor data. In this work, we address the problem of learning driving policies for an autonomous agent in a high-fidelity simulator. Building upon recent research that applies deep reinforcement learning to navi…

2019-02-11abs ↗pdf ↗

Unified Bayesian model explains in-context learning and activation steering in LLMs.

problem Understanding and controlling the behavior of large language models (LLMs) through prompts and activations.
method Developed a Bayesian model to explain and predict the effects of in-context learning and activation steering.
result Unified model predicts distinct phases and sudden shifts in LLM behavior, explaining prior empirical phenomena.

MFMs enable efficient reward alignment for generative models.

problem Computational bottleneck in controlling generative models.
method Meta Flow Maps (MFMs) extend consistency models and flow maps to stochastic regime for efficient value function estimation.
result MFMs enable inference-time steering and unbiased, off-policy fine-tuning to general rewards efficiently.

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.

Bayesian Power Steering fine-tunes large diffusion models for domain adaptation.

problem Fine-tuning pre-trained diffusion models for tasks in a smaller probability space.
method Bayesian framework with a novel network structure (Bayesian Power Steering).
result Bayesian Power Steering achieves an FID score of 10.49 on the COCO17 dataset.

Hybrid model uses LLM to build transparent Bayesian networks for trading decisions.

problem Rigorous and transparent reasoning required in financial trading, especially for options strategies.
method Combines LLM strengths with Bayesian Networks, using LLM to construct context-specific networks and select relevant data.
result Empirically, the hybrid system outperforms market benchmarks with superior risk-adjusted performance.

ELS framework improves safety alignment by dynamically steering LLMs towards helpful responses.

problem Over-Refusal in Aligned Large Language Models
method Fine-tuning free framework using an Energy-Based Model (EBM) to dynamically steer LLMs during inference.
result Extensive experiments show a significant reduction in false refusals (from 57.3% to 82.6%) while maintaining safety performance.