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

74148222296 · May 202619922001200920172026
48 results for Inverse Rational Control

New method identifies flawed internal models of the world in animals.

problem How animals make decisions with partial sensory information.
method Generalizes Inverse Rational Control to continuous nonlinear dynamics and noise.
result Identifies the best internal model explaining an agent's actions.

Paper develops a framework for learning interpretable representations of sequential decision behavior.

problem Obtaining a transparent description of existing behavior.
method Inverse decision modeling framework, formalizing both forward and inverse problems.
result Learning interpretable representations of behavior, including suboptimal actions, biased beliefs, and imperfect knowledge.

A method is proposed to construct spiral curves by inversion of a spiral arc of parabola. The resulting curve is rational of 4-th order. Proper selection of the parabolic arc and parameters of inversion allows to match a wide range of boundary conditions, namely, tangents and curvatures at the endpoints, including thos…

2009-02-27abs ↗pdf ↗

New framework recovers reward and rationality parameters from game behavior.

problem Statistical ambiguity in identifying reward and rationality parameters in competitive games.
method Blind Inverse Game Theory (Blind-IGT) using entropy-regularized Quantal Response Equilibrium and Normalized Least Squares (NLS) estimator.
result Optimal convergence rate of O(N1/2)\mathcal{O}(N^{-1/2}) for joint parameter recovery.

This work presents a game-theoretic method for AVs that handles imperfect communication and individual rewards.

problem Real-time, imperfect communication and individual rewards in multi-agent interactions.
method Game-theoretic approach that allows for imperfect communication and individual rewards.
result More realistic assumptions lead to better reward inference and prediction of future actions.

Modeling the purposeful behavior of imperfect agents from a small number of observations is a challenging task. When restricted to the single-agent decision-theoretic setting, inverse optimal control techniques assume that observed behavior is an approximately optimal solution to an unknown decision problem. These tech…

2013-08-15abs ↗pdf ↗

We study the inverse optimal control problem in social sciences: we aim at learning a user's true cost function from the observed temporal behavior. In contrast to traditional phenomenological works that aim to learn a generative model to fit the behavioral data, we propose a novel variational principle and treat user …

2018-05-22abs ↗pdf ↗

Normalizing flows attempt to model an arbitrary probability distribution through a set of invertible mappings. These transformations are required to achieve a tractable Jacobian determinant that can be used in high-dimensional scenarios. The first normalizing flow designs used coupling layer mappings built upon affine …

2020-01-15abs ↗pdf ↗

The paper calculates heat kernel and closed geodesic asymptotics for nilpotent coverings.

problem Heat kernel and closed geodesic asymptotics for nilpotent coverings.
method Finite-dimensional rational Floquet-Bloch theory, Pytlik functional, and spectral sums.
result Genuinely local, pointwise higher-order heat-kernel expansions.

Inverse optimal control, also known as inverse reinforcement learning, is the problem of recovering an unknown reward function in a Markov decision process from expert demonstrations of the optimal policy. We introduce a probabilistic inverse optimal control algorithm that scales gracefully with task dimensionality, an…

2012-06-18abs ↗pdf ↗

We show that when the genus and punctures of a surface are directly proportional by some rational number the minimal asymptotic translation length in the curve complex has behavior inverse to the square of the Euler characteristic. We also show that when the genus is fixed and the number of punctures varies the behavio…

2013-04-24abs ↗pdf ↗

Fintushel and Stern defined the rational blow-down construction [FS] for smooth 4-manifolds, where a linear plumbing configuration of spheres CnC_n is replaced with a rational homology ball BnB_n, n2n \geq 2. Subsequently, Symington [Sy] defined this procedure in the symplectic category, where a symplectic CnC_n (given…

2013-03-11abs ↗pdf ↗

New method disentangles perceptual uncertainty and behavioral costs in partially observable systems.

problem Tackles inverse optimal control for non-linear partially observable systems.
method Probabilistic approach using maximum causal entropy formulations and local linearization.
result Disentangles perceptual factors and behavioral costs in sequential decision-making.

Classifies degenerations of complex projective plane with rational singularities.

problem Classifying singularities of complex projective plane.
method Assuming Wahl's conjecture, classifies degenerations using rational homology disk smoothing.
result Classifies surfaces with rational singularities, including new degenerations with non-log canonical singularities.

This article is devoted to the study of a general class of Hamiltonian systems which extends the Calogero systems with external quadratic potential associated to any root system. The interest for such a class comes from a previous article of Aomoto and Forrester. We consider first the one-degree of freedom case and com…

2013-02-06abs ↗pdf ↗

New method for PKM inverse dynamics second derivatives efficiently.

problem Efficient computation of PKM inverse dynamics second derivatives.
method Recursive Lie-group formulation for serial robots adapted to PKM topology.
result Efficient computation of second time derivatives for PKM.

Complex behaviors are often driven by an internal model, which integrates sensory information over time and facilitates long-term planning. Inferring an agent's internal model is a crucial ingredient in social interactions (theory of mind), for imitation learning, and for interpreting neural activities of behaving agen…

2018-05-24abs ↗pdf ↗

FlowChef steers RFMs to efficiently guide image generation tasks.

problem Efficiently guiding image generation tasks with RFMs.
method Developed a theoretical and empirical understanding of RFMs' vector field dynamics, proposing FlowChef for gradient-free navigation.
result FlowChef significantly outperforms baselines in performance, memory, and time requirements.

We develop an epsilon-controlled algebraic L-theory, extending our earlier work on epsilon-controlled algebraic K-theory. The controlled L-theory is very close to being a generalized homology theory; we study analogues of the homology exact sequence of a pair, excision properties, and the Mayer--Vietoris exact sequence…

2004-02-13abs ↗pdf ↗

Generative neural network designs novel 3D molecules with specified properties.

problem Designing molecules with desired properties in chemistry.
method Conditional generative neural network for 3D molecular structures.
result Demonstrated utility in generating novel molecules with specified motifs or composition.

We study the group of rational concordance classes of codimension two knots in rational homology spheres. We give a full calculation of its algebraic theory by developing a complete set of new invariants. For computation, we relate these invariants with limiting behaviour of the Artin reciprocity over an infinite tower…

2006-09-14abs ↗pdf ↗

Given a finite metric CW complex XX and an element απn(X)α\in π_n(X), what are the properties of a geometrically optimal representative of αα? We study the optimal volume of kα as a function of kk. Asymptotically, this function, whose inverse, for reasons of tradition, we call the volume distortion, turns out to be an…

2014-10-13abs ↗pdf ↗

Optimizes insurance pricing by accounting for policyholders' price sensitivity.

problem Traditional insurance pricing does not consider policyholders' price sensitivity.
method Formulates insurance pricing as a decision-making problem and uses off-policy evaluation and stochastic control.
result Neural networks outperform existing techniques for policy optimization.

Efficiently computes matrix square roots and their inverses for large matrices.

problem Computing matrix square roots and inverses for large matrices efficiently.
method Combines Krylov subspace methods with rational approximation for quadratic-time computation.
result Achieves 4 decimal places of accuracy with fewer than 100 matrix-vector multiplications.

We discuss the spectral curves and rational maps associated with SU(2)SU(2) Bogomolny monopoles of arbitrary charge kk. We describe the effect on the rational maps of inverting monopoles in the plane with respect to which the rational maps are defined, and discuss the monopoles invariant under such inversion. We define t…

1994-07-18abs ↗pdf ↗

The paper addresses human-like decision-making in multi-agent systems using bounded risk-sensitive Markov Games.

problem Modeling human-like decision-making in multi-agent systems with risk-seeking and loss-aversion behaviors.
method Forward policy design and inverse reward learning with iterative reasoning and cumulative prospect theory.
result The proposed algorithms demonstrate both risk-averse and risk-seeking behaviors in multi-agent systems.

AIRL learns robust, generalizable reward functions from demonstrations.

problem Learning robust reward functions from demonstrations for changing environments.
method Adversarial Inverse Reinforcement Learning (AIRL) with hierarchical disentangled rewards.
result Generalizable policies and comparable results to state-of-the-art methods.

This paper provides a full controlled version of algebraic KK-theory. This includes a rich array of assembly maps; the controlled assembly isomorphism theorem identifying the controlled group with homology; and the stability theorem describing the behavior of the inverse limit as the control parameter goes to 0. There…

2004-02-24abs ↗pdf ↗

Reinforcement learning agents are prone to undesired behaviors due to reward mis-specification. Finding a set of reward functions to properly guide agent behaviors is particularly challenging in multi-agent scenarios. Inverse reinforcement learning provides a framework to automatically acquire suitable reward functions…

2019-07-30abs ↗pdf ↗

Sharp estimate shows maps with small energy defect are close to rational maps.

problem Quantitative rigidity of maps from S2S^2 to S2S^2 of general degree.
method Proved maps with small energy defect are essentially given by a collection of rational maps at different scales.
result Sharp quantitative rigidity estimate dist2Cδv(1+logδv)dist^2 \leq C δ_v(1+\vert\logδ_v\vert), sharpness shown.

Modeling driver trajectories using inverse reinforcement learning and random utility.

problem Modeling rational driver behavior in road networks from sparse sensor data.
method Apply random utility theory to model unknown reward function, introduce extended state, and use Markov decision process.
result Maximum entropy inverse reinforcement learning is a special case of the proposed approach.

Geometric framework explains and controls implicit bias in machine learning.

problem Understanding and controlling the selection of solutions in overparameterized models.
method Developed a theoretical and constructive framework based on geometric corrections induced by gradient noise and continuous symmetries of the loss.
result Computed the induced bias across various architectures and enabled inverse design to shape the bias.

New approach transfers rewards learned in one environment to reinforcement learning in a new environment.

problem Transfer of rewards learned using inverse reinforcement learning from one environment to a new, different environment.
method Formulate the problem as a joint system of Bellman equations, develop minimax estimators for the target soft-qq-function, solve the source and target system of equations jointly.
result The coupled approach removes the first-order influence of source Bellman residual error compared to the sequential approach.