CoTj improves diffusion model quality and stability via graph planning.
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.
Trend · papers per month
Under mild regularity assumptions, the transport problem is stable in the following sense: if a sequence of optimal transport plans converges weakly to a transport plan , then is also optimal (between its marginals). Alfonsi, Corbetta and Jourdain asked whether the same property is true for th…
New algorithm for planning in observable POMDPs in quasi-polynomial time.
The paper analyzes stability and convergence rates of entropic and Sinkhorn potentials.
MuZero visualizes its internal representations to stabilize planning.
Future grid scenario analysis requires a major departure from conventional power system planning, where only a handful of most critical conditions is typically analyzed. To capture the inter-seasonal variations in renewable generation of a future grid scenario necessitates the use of computationally intensive time-seri…
This paper studies when particle filtering is efficient for planning in partially observed systems.
The paper analyzes reinsurance strategies in peer-to-peer insurance schemes.
This paper presents a novel two-step approach for the fundamental problem of learning an optimal map from one distribution to another. First, we learn an optimal transport (OT) plan, which can be thought as a one-to-many map between the two distributions. To that end, we propose a stochastic dual approach of regularize…
We propose a plan online and learn offline (POLO) framework for the setting where an agent, with an internal model, needs to continually act and learn in the world. Our work builds on the synergistic relationship between local model-based control, global value function learning, and exploration. We study how local traj…
New stability bounds for Sinkhorn's algorithm in entropic optimal transport.
New framework formalizes estimating valid transport maps, revealing their statistical limits.
This work enables UAVs to autonomously form desired trajectories without needing a central plan.
DTM improves dLLM fine-tuning stability and performance.
New RL algorithm ensures stable, replicable policies.
The paper tackles model misspecification in reinforcement learning through a bootstrapped neural network and error correction.
We revisit residual algorithms in both model-free and model-based reinforcement learning settings. We propose the bidirectional target network technique to stabilize residual algorithms, yielding a residual version of DDPG that significantly outperforms vanilla DDPG in the DeepMind Control Suite benchmark. Moreover, we…
The paper analyzes how mutable blockchain protocols affect miner behavior and strategic stability.
SRL embeds combinatorial optimization into RL for better decision-making.
DiffSlack learns neural networks with nonlinear constraints via learnable slack variables.
New method designs fairer transport plans with uncertainty.
Improves RL planning by proposing sub-goals hierarchically.
We aim to reduce the burden of programming and deploying autonomous systems to work in concert with people in time-critical domains, such as military field operations and disaster response. Deployment plans for these operations are frequently negotiated on-the-fly by teams of human planners. A human operator then trans…
Study integrates reliability constraints into generation planning models.
New approach improves black-box planning efficiency by discovering focused macros.
Study motion planning for points avoiding obstacles in a plane.
Selective planning with imperfect models reduces harmful effects of model inadequacy.
CoMPNetX uses neural networks to efficiently solve constrained motion planning problems.
Unified framework explains retirement and annuitization decisions under age-dependent mortality.
This article asks how planning scholarship may effectively gain impact in planning practice through media exposure. In liberal democracies the public sphere is dominated by mass media. Therefore, working with such media is a prerequisite for effective public impact of planning research. Using the example of megaproject…
We introduce Dynamic Planning Networks (DPN), a novel architecture for deep reinforcement learning, that combines model-based and model-free aspects for online planning. Our architecture learns to dynamically construct plans using a learned state-transition model by selecting and traversing between simulated states and…
This paper presents a unifying framework for reinforcement learning and planning.
A planning approach learns skills from interactions, balancing exploration and exploitation.
Survey of integrating planning and learning in model-based reinforcement learning.
Fast and efficient motion planning algorithms are crucial for many state-of-the-art robotics applications such as self-driving cars. Existing motion planning methods become ineffective as their computational complexity increases exponentially with the dimensionality of the motion planning problem. To address this issue…
New approach for obstacle avoidance in robotics using learned representations.
Reinforcement learning and symbolic planning have both been used to build intelligent autonomous agents. Reinforcement learning relies on learning from interactions with real world, which often requires an unfeasibly large amount of experience. Symbolic planning relies on manually crafted symbolic knowledge, which may …
A key challenge in complex visuomotor control is learning abstract representations that are effective for specifying goals, planning, and generalization. To this end, we introduce universal planning networks (UPN). UPNs embed differentiable planning within a goal-directed policy. This planning computation unrolls a for…
This work clarifies the role of inference types in planning.
In recent years, deep generative models have been shown to 'imagine' convincing high-dimensional observations such as images, audio, and even video, learning directly from raw data. In this work, we ask how to imagine goal-directed visual plans -- a plausible sequence of observations that transition a dynamical system …
This work tackles long-term visual planning by goal-conditioned hierarchical predictors.
Knowledge-based planning (KBP) is an automated approach to radiation therapy treatment planning that involves predicting desirable treatment plans before they are then corrected to deliverable ones. We propose a generative adversarial network (GAN) approach for predicting desirable 3D dose distributions that eschews th…
We designed a grid world task to study human planning and re-planning behavior in an unknown stochastic environment. In our grid world, participants were asked to travel from a random starting point to a random goal position while maximizing their reward. Because they were not familiar with the environment, they needed…
Efficient driving in urban traffic scenarios requires foresight. The observation of other traffic participants and the inference of their possible next actions depending on the own action is considered cooperative prediction and planning. Humans are well equipped with the capability to predict the actions of multiple i…
This work defines a complexity measure for BAMDP planning and introduces state abstraction for more efficient approximate planning.
With the growth of renewable generation (RG) and the development of associated ride through curves serving as operating limits, during disturbances, on violation of these limits, the power system is at risk of losing large amounts of generation. In order to identify preventive control measures that avoid such scenarios…
Information planning enables faster learning with fewer training examples. It is particularly applicable when training examples are costly to obtain. This work examines the advantages of information planning for text data by focusing on three supervised models: Naive Bayes, supervised LDA and deep neural networks. We s…
The computational costs of inference and planning have confined Bayesian model-based reinforcement learning to one of two dismal fates: powerful Bayes-adaptive planning but only for simplistic models, or powerful, Bayesian non-parametric models but using simple, myopic planning strategies such as Thompson sampling. We …