First model-based planner learns to construct, evaluate, and execute plans.
problem Challenges in model-based planning, especially in constructing plans.
method Imagination-based Planner that learns to construct, evaluate, and execute plans.
result Can learn to solve challenging continuous control problems and elaborate planning strategies.
Financial planners helped preserve and increase household net financial assets during the Great Recession.
problem Impact of financial planners on household net financial assets during the Great Recession.
method Utilized 2007-2009 Survey of Consumer Finances (SCF) panel dataset, analyzed 3,862 respondents.
result Starting to use a financial planner during the Great Recession had a positive impact on preserving and increasing household net financial assets.
Graph neural networks improve online planner selection for AI tasks.
problem Selecting the best planner for AI tasks.
method Graph Neural Network (GNN) for planner selection and adaptive scheduling.
result Improved planner selection and scheduling for cost-optimal planning.
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…
Study optimal investment decisions for diverse risk-tolerant agents.
problem Optimizing investment choices for agents with varying risk preferences.
method Characterizes optimal behavior using certainty equivalents and lognormal risks.
result Derives optimal decision menus under known and uncertain preference distributions.
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 1, thus showing th…
New research shows exponential lower bounds for planning in MDPs with linearly-realizable optimal action-value functions.
problem Determining the minimum number of queries needed for sound planners in MDPs with linear function approximation.
method Analyzing fixed-horizon and discounted MDPs with a generative model, showing lower bounds on the number of queries required.
result Sound planners need at least exponential number of queries in both fixed-horizon and discounted settings.
Develops an equilibrium model for securities pricing in a mixed cooperative and non-cooperative market.
problem Equilibrium pricing of securities in a market with cooperative and non-cooperative agents.
method Conditional extended mean-field control for cooperative agents, mean-field model for both cooperative and non-cooperative agents.
result Existence of a unique equilibrium for both finite-agent and mean-field models under certain conditions.
The paper optimizes pension policies with guarantees and sustainability constraints.
problem Designing optimal pension policies with guarantees and sustainability constraints.
method Dynamic utility model, stochastic domain, overlapping generations, time-consistent decision criterion.
result Optimal investment/pension policy computed for a general framework.
New approach learns human planning algorithms for reward inference.
problem Learning reward functions from human demonstrations with biases.
method Data-driven approach to learn planning algorithms directly from demonstrations.
result Mixed results: better reward inference but at cost of differentiability.
A reinforcement learning framework combining value function and tree search planner for strategic and tactical decisions.
problem Strategic and tactical decision-making in discrete environments.
method Combines value function and tree search planner, using uncertainty modeling and risk measurement.
result Improves performance and learning speed on hard exploration environments.
VASE learns disentangled representations that generalize across domains.
problem Learning new knowledge from diverse data sources while preserving old knowledge.
method VASE uses shared embeddings and Minimum Description Length principle to disentangle representations.
result VASE achieves better cross-domain inference and disentangled representations.
Agent learns to navigate uncertain 3D maps using a hybrid planner.
problem Planning in 3D environments with uncertain topological maps.
method Hierarchical strategy combining graph planner and local policy, data-driven learning with neural network.
result Machine learning can overcome missing information in probabilistic topological maps.
Study presents a low-cost local motion planner for vineyard navigation.
problem Autonomous navigation in vineyards with limited resources.
method RGB-D camera, dual layer control algorithm, deep learning synergy.
result Robust motion planning for vineyard navigation achieved.
Algorithm learns fair division from noisy feedback in uncertain markets.
problem Learning fair division in uncertain markets with noisy feedback.
method Wrapper algorithms using dual averaging to learn item and agent values from bandit feedback.
result Asymptotically achieves optimal Nash social welfare in linear Fisher markets.
Improved model-based reinforcement learning for interactive dialogue tasks reduces sample needs and improves performance.
problem Limited data and high sample cost in interactive dialogue systems.
method Model-based actor-critic approach with an environment model and planner.
result 70 times fewer samples required compared to baseline model-free algorithm, with 2x better asymptotic performance.
XLVINs improve data efficiency in implicit planning by leveraging latent space.
problem Improving data efficiency in implicit planning algorithms.
method XLVINs use a high-dimensional latent space to perform planning computations, breaking the algorithmic bottleneck.
result XLVINs significantly improve data efficiency across various settings compared to value iteration-based implicit planners and model-free baselines.
End-to-end learnable network for safer self-driving with interpretable intermediate representations.
problem Safe motion planning for self-driving vehicles.
method Differentiable semantic occupancy representation for cost calculation in motion planning.
result Significantly outperforms state-of-the-art planners in imitating human behaviors and producing safer trajectories.
Bayesian uncertainty from deep learning improves robot safety in unknown areas.
problem Improving robot safety in unknown or dangerous environments.
method Bayesian approximations of uncertainty from deep learning in a robot planner.
result Incorporating uncertainty leads to 18% less risky paths.
Model analyzes optimal interbank networks during liquidity shocks, revealing core-periphery structures and co-investment requirements.
problem Formation of optimal interbank networks during liquidity shocks.
method Solves system-wide optimal control problem in two settings: decentralized and centralized.
result Decentralized setting leads to less cash reserves and greater vulnerability to shocks; core banks have highest co-investment requirements.
New approach improves black-box planning efficiency by discovering focused macros.
problem Difficulty of deterministic planning increases exponentially with depth.
method Discovering macro-actions with focused effects to improve goal-count heuristics.
result Focused macros dramatically improve black-box planning efficiency.
New algorithm learns FMDP structure while minimizing regret.
problem Regret minimization in FMDPs with unknown structure.
method Optimism in face of uncertainty principle combined with statistical structure learning.
result First algorithm to learn FMDP structure while minimizing regret.
DDPD separates generation into planning and denoising for improved efficiency.
problem Efficiently denoise corrupted data during generation.
method Separates generation into a planner and denoiser, selecting denoising positions based on corruption severity.
result DDPD outperforms traditional methods on language and image generation benchmarks.
Size-independent neural transfer for RDDL planning.
problem Sample inefficiency and time-consuming training for neural planners of RDDL MDPs.
method Two key innovations: state encoder and parameter-tied action decoder.
result Powerful transfer across problem sizes with superior learning curves.
TIM framework uses LLMs and domain experts to infer DeFi user transaction intents.
problem Challenges in understanding user intent in DeFi transactions due to complex interactions and opaque logs.
method TIM framework leverages a DeFi intent taxonomy, multi-agent LLM system, and a Meta-Level Planner.
result TIM significantly outperforms existing methods in inferring user transaction intents.
Investment strategies for rank-dependent utility agents are derived in a continuous-time market.
problem Time inconsistency in rank-dependent utility models.
method Study of consistent planners seeking intra-personal equilibrium strategies.
result Explicit final wealth profile replicating equilibrium strategies, with scaling function derived.
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 …
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.
problem Challenges in applying machine learning to search-based path planning.
method Reformulated A* search as a differentiable network coupled with a convolutional encoder.
result Neural A* outperforms state-of-the-art planners in optimality and efficiency.
This paper builds a model to predict the long-term future in reinforcement learning.
problem Catastrophic failures due to flawed long-term predictions in reinforcement learning models.
method The authors develop a latent-variable autoregressive model using variational inference to incorporate future information.
result The model achieves higher rewards faster than baselines on various tasks and environments.
New algorithm for traffic routing in congested conditions.
problem Optimal routing in congested traffic networks.
method Congested Bandits model, UCB algorithm, iterative least squares planner.
result No-regret algorithms for congestion-aware routing.
A method uses RL to learn abstractions for planning, improving robot navigation and manipulation tasks.
problem Planning requires suitable abstractions for states and transitions, which RL struggles with for temporally extended tasks.
method Goal-conditioned policies learned with RL are incorporated into planning, with a latent variable model representing valid states.
result Our method significantly outperforms prior work on image-based robot navigation and manipulation tasks.
Semi-analytical approach for optimal wealth management contributions.
problem Optimizing contributions to achieve a financial goal with uncertain returns.
method Controlled backward Kolmogorov equation and Schrodinger equation solution.
result Semi-analytical solutions for efficient frontiers in control space.
Study optimal stopping for group with diverse discount rates using an attitude function.
problem Optimal stopping for a group with diverse discount rates under an aggregation preference.
method Develop iterative approach using consistent planning for time-consistent equilibria.
result Characterize all time-consistent mild equilibria as fixed points of an operator.
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.
problem Understanding how probability weighting affects economic behavior and risk aversion.
method Examining a von Neumann-Morgenstern economy with an RDU agent to model probability weighting effects.
result Probability weighting can lead to endogenous betting in an economy with common beliefs.
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 …
Optimal scheme minimizes deviation in federated transfer learning for kernel regression.
problem Minimizing cumulative deviation in federated transfer learning across multiple datasets.
method Regret-optimal iterative scheme for continual communication between nodes and server.
result Explicit updates for the regret-optimal algorithm in finite-rank kernel regression.
In this paper, we consider the problem of optimal reinsurance design, when the risk is measured by a distortion risk measure and the premium is given by a distortion risk premium. First, we show how the optimal reinsurance design for the ceding company, the reinsurance company and the social planner can be formulated i…
Study shows how multiple traders can trade together without excessive price impact.
problem Coordination issues in trading to exploit a common signal.
method Closed-loop Nash competition model for stochastic differential games.
result Excessive trading reduced but not significantly for practical parameters.
Naive investors make riskier choices than optimal strategies in continuous-time finance.
problem Continuous-time Markowitz portfolio selection with naive reoptimization.
method Analytical derivation of naive policies from discretely naive policies.
result Naive policies are always riskier and less efficient than equilibrium policies.
Turnpike property applies to optimal control of PDEs and ResNets.
problem Optimal control of PDEs and ResNets.
method Mathematical formalization and controllability analysis.
result Optimal controls and states are nearly constant over most of the time.
Perceptor Gradients learns symbolic representations from raw data.
problem Learning transferable symbolic representations from raw data.
method Decomposes policy into perceptor network and task encoding program.
result Efficiently learns symbolic representations for control tasks.
This paper presents a bus travel time prediction system using deep neural networks.
problem Accurate travel time predictions for urban buses to compete with other modes of transport.
method Multi-output, multi-time-step deep neural network combining convolutional and LSTM layers.
result The proposed model significantly outperforms other methods and detects small irregular peaks quickly.
Study minimizes market inefficiency in systemic economies.
problem Minimizing deviations of market prices from fundamental values.
method Characterized market inefficiency and developed a matrix of holdings to minimize it.
result Portfolio holdings should deviate more from diversification if banks have similar systemic significance.
CEM-GD combines CEM and gradient descent for efficient model-based RL.
problem Efficient planning in continuous control settings with large prediction horizons.
method Combines CEM for exploration and gradient descent for exploitation.
result Achieves better performance with fewer samples and less computation time.
Combines parametric and nonparametric models for better off-policy evaluation.
problem Improving off-policy evaluation in reinforcement learning.
method Mixture-of-experts approach combining parametric and nonparametric models.
result Mixture-based approach outperforms individual models and state-of-the-art estimators.