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.
TIM framework uses LLMs and domain experts to infer DeFi user transaction intents.
Meta-algorithm selection aims to choose the best algorithm selector for a given problem instance.
Financial planners helped preserve and increase household net financial assets during the Great Recession.
Automated planning is one of the foundational areas of AI. Since no single planner can work well for all tasks and domains, portfolio-based techniques have become increasingly popular in recent years. In particular, deep learning emerges as a promising methodology for online planner selection. Owing to the recent devel…
We introduce a framework for model learning and planning in stochastic domains with continuous state and action spaces and non-Gaussian transition models. It is efficient because (1) local models are estimated only when the planner requires them; (2) the planner focuses on the most relevant states to the current planni…
Model interpretability is a requirement in many applications in which crucial decisions are made by users relying on a model's outputs. The recent movement for "algorithmic fairness" also stipulates explainability, and therefore interpretability of learning models. And yet the most successful contemporary Machine Learn…
We introduce a variant of Farber's topological complexity, defined for smooth compact orientable Riemannian manifolds, which takes into account only motion planners with the lowest possible "average length" of the output paths. We prove that it never differs from topological complexity by more than , thus showing th…
Study optimal investment decisions for diverse risk-tolerant agents.
New PAC bound for meta-learning improves generalization guarantees.
New research shows exponential lower bounds for planning in MDPs with linearly-realizable optimal action-value functions.
Paper shows how meta-learning can reduce prior learning cost.
Develops an equilibrium model for securities pricing in a mixed cooperative and non-cooperative market.
The paper optimizes pension policies with guarantees and sustainability constraints.
Agent learns to navigate uncertain 3D maps using a hybrid planner.
Study presents a low-cost local motion planner for vineyard navigation.
Algorithm learns fair division from noisy feedback in uncertain markets.
Improved model-based reinforcement learning for interactive dialogue tasks reduces sample needs and improves performance.
XLVINs improve data efficiency in implicit planning by leveraging latent space.
Neural networks have been successfully applied in applications with a large amount of labeled data. However, the task of rapid generalization on new concepts with small training data while preserving performances on previously learned ones still presents a significant challenge to neural network models. In this work, w…
End-to-end learnable network for safer self-driving with interpretable intermediate representations.
Our goal is for agents to optimize the right reward function, despite how difficult it is for us to specify what that is. Inverse Reinforcement Learning (IRL) enables us to infer reward functions from demonstrations, but it usually assumes that the expert is noisily optimal. Real people, on the other hand, often have s…
This work proposes the use of Bayesian approximations of uncertainty from deep learning in a robot planner, showing that this produces more cautious actions in safety-critical scenarios. The case study investigated is motivated by a setup where an aerial robot acts as a "scout" for a ground robot. This is useful when t…
We propose a reinforcement learning framework for discrete environments in which an agent makes both strategic and tactical decisions. The former manifests itself through the use of value function, while the latter is powered by a tree search planner. These tools complement each other. The planning module performs a lo…
Model analyzes optimal interbank networks during liquidity shocks, revealing core-periphery structures and co-investment requirements.
New approach improves black-box planning efficiency by discovering focused macros.
New algorithm learns FMDP structure while minimizing regret.
Neural planners for RDDL MDPs produce deep reactive policies in an offline fashion. These scale well with large domains, but are sample inefficient and time-consuming to train from scratch for each new problem. To mitigate this, recent work has studied neural transfer learning, so that a generic planner trained on othe…
In model-based reinforcement learning, the agent interleaves between model learning and planning. These two components are inextricably intertwined. If the model is not able to provide sensible long-term prediction, the executed planner would exploit model flaws, which can yield catastrophic failures. This paper focuse…
DDPD separates generation into planning and denoising for improved efficiency.
Research on neural networks has gained significant momentum over the past few years. Because training is a resource-intensive process and training data cannot always be made available to everyone, there has been a trend to reuse pre-trained neural networks. As such, neural networks themselves have become research data.…
Investment strategies for rank-dependent utility agents are derived in a continuous-time market.
In this paper we study continuous-time stochastic control problems with both monotone and classical controls motivated by the so-called public good contribution problem. That is the problem of n economic agents aiming to maximize their expected utility allocating initial wealth over a given time period between private …
Planning methods can solve temporally extended sequential decision making problems by composing simple behaviors. However, planning requires suitable abstractions for the states and transitions, which typically need to be designed by hand. In contrast, model-free reinforcement learning (RL) can acquire behaviors from l…
With a point of departure in the concept "uncomfortable knowledge," this article presents a case study of how the American Planning Association (APA) deals with such knowledge. APA was found to actively suppress publicity of malpractice concerns and bad planning in order to sustain a boosterish image of planning. In th…
Neural A* uses machine learning to improve path planning efficiency.
Self-referential meta learning avoids explicit optimization by modifying itself.
F-PACOH improves meta-learners' reliability in uncertain regions.
Meta-learning can successfully acquire useful inductive biases from data. Yet, its generalization properties to unseen learning tasks are poorly understood. Particularly if the number of meta-training tasks is small, this raises concerns about overfitting. We provide a theoretical analysis using the PAC-Bayesian framew…
New algorithm for traffic routing in congested conditions.
Semi-analytical approach for optimal wealth management contributions.
Study optimal stopping for group with diverse discount rates using an attitude function.
This article presents results from the first statistically significant study of traffic forecasts in transportation infrastructure projects. The sample used is the largest of its kind, covering 210 projects in 14 nations worth US$59 billion. The study shows with very high statistical significance that forecasters gener…
The study shows how probability weighting can lead to betting in a risk-averse economy.
This paper presents a general framework for studying diverse beliefs in dynamic economies. Within this general framework, the characterization of a central-planner general equilbrium turns out to be very easy to derive, and leads to a range of interesting applications. We show how for an economy with log investors hold…
Recent research in economic theory attempts to study optimal economic growth and spatial location of economic activity in a unified framework. So far, the key result of this literature - asymptotic convergence, even in the absence of decreasing returns to capital - relies on specific assumptions about the objective of …
We present the perceptor gradients algorithm -- a novel approach to learning symbolic representations based on the idea of decomposing an agent's policy into i) a perceptor network extracting symbols from raw observation data and ii) a task encoding program which maps the input symbols to output actions. We show that t…
We consider a model-based approach to perform batch off-policy evaluation in reinforcement learning. Our method takes a mixture-of-experts approach to combine parametric and non-parametric models of the environment such that the final value estimate has the least expected error. We do so by first estimating the local a…
Optimal scheme minimizes deviation in federated transfer learning for kernel regression.