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

11223344 · Jun 202019922001200920172026
48 results for LLM-based planning

Study on limits of LLM-based multi-agent planning reliability.

problem Reliability limits of LLM-based multi-agent planning.
method Modeling LLM-based multi-agent architecture as a decision network, showing dominance by centralized Bayes decision maker.
result Optimizing multi-agent directed acyclic graphs under communication budget is equivalent to choosing a constrained experiment.

A new LLM-based method enhances diversity in oversampling for imbalanced classification.

problem Limited diversity in synthetic minority samples generated by current LLM-based approaches reduces robustness and generalizability.
method Condition synthetic sample generation on minority labels and features, use permutation strategy for fine-tuning, fine-tune on minority and interpolated samples.
result Significantly outperforms eight SOTA baselines in diverse synthetic sample generation and downstream classification tasks.

Bayesian approach quantifies uncertainty in LLM-based systems.

problem Uncertainty quantification in LLM-based systems, especially for high-stakes applications.
method Interpreting prompts as parameters in a Bayesian model, using MHLP for inference.
result Improvements in predictive accuracy and uncertainty quantification on various benchmarks.

Efficiently estimates uncertainty for LLM-based entity linking in tabular data.

problem Accurate and reliable uncertainty estimates for LLM-based entity linking in tabular data.
method Self-supervised approach using token-level features for single-shot inference.
result Effective uncertainty estimates detected at a fraction of computational cost.

MountainLion uses LLMs to interpret financial data and generate investment strategies.

problem Challenges in integrating heterogeneous data for financial trading.
method Multi-modal LLM-based agents that process textual and visual data.
result Improves returns and investor confidence through interpretable investment framework.

Developing an AI economist agent using RAG, knowledge graphs, and LLMs for economic scenario analysis.

problem Economic scenario analysis using large language models and knowledge graphs.
method Proposing an RAG-based AI economist framework that utilizes knowledge graphs and LLMs.
result Improves economic coherence and traceability in generated reports.

Study reduces human labeling in LLM-based classification systems.

problem Minimizing human intervention in training LLM-based classification systems.
method Active learning framework with Conservative Hull-based Classifier (CHC), Center-based Classifier (CC), and Generalized Hull-based Classifier (GHC).
result CHC achieves O(logdT)\mathcal{O}(\log^d T) regret and is minimax optimal for d=1d=1. GHC bridges the gap between different regimes.

Enhances anomaly detection in financial markets using AI agents.

problem Manual verification of financial market anomalies is time-consuming and error-prone.
method A multi-agent LLM framework for automated anomaly detection.
result Framework reduces human intervention and improves efficiency and accuracy.

AI helps simplify complex ship finance processes.

problem Complexity in ship finance due to data and regulatory requirements.
method Integrates large language models for document comprehension, information extraction, and workflow automation.
result AI-assisted systems can support maritime finance professionals in managing complex information and reporting requirements.

LLMs mimic human traders in finance, but not as much as expected.

problem Evaluating how LLMs behave in financial markets.
method Adapted experimental design with LLMs and human traders, analyzed in single and mixed model settings.
result LLMs tend to price assets near their fundamental value, but not as much as humans, and show less trading strategy variance.

Study integrates reliability constraints into generation planning models.

problem Challenges in integrating reliability constraints with generation planning models.
method Leverages a weighted oblique decision tree (WODT) technique to embed reliability verification constraints.
result Demonstrates effectiveness in achieving reliable and optimal planning solutions.

Improved crude oil price forecasting using multi-dimensional LLM sentiment signals.

problem Challenges in predicting crude oil prices due to unstructured news.
method Extracted five sentiment dimensions from GPT-4o, Llama 3.2-3b, and FinBERT models on energy-sector news articles.
result Combining GPT-4o and FinBERT yields the best predictive performance for weekly WTI crude oil futures returns.

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.

Selective planning with imperfect models reduces harmful effects of model inadequacy.

problem Harmful effects of using an imperfect model in reinforcement learning.
method Selective planning with heteroscedastic regression to estimate predictive uncertainty from model inadequacy.
result Effective selective planning requires considering both parameter uncertainty and model inadequacy.

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…

2013-04-05abs ↗pdf ↗

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…

2018-12-28abs ↗pdf ↗

BeGIN benchmarks GNNs for instance-dependent label noise in graphs.

problem Instance-dependent label noise in graph data.
method BeGIN introduces a benchmark with various noise types and evaluates noise-handling strategies across GNN architectures.
result Challenges of instance-dependent noise, especially LLM-based corruption, and the importance of node-specific parameterization.

A planning approach learns skills from interactions, balancing exploration and exploitation.

problem Learning robust high-level skills in noisy environments with unknown pre-conditions.
method Formulates skills as high-level policies, learns plans via bandit problems, balances exploration and exploitation.
result A planner capable of learning robust high-level skills in high-dimensional state spaces.

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…

2018-06-14abs ↗pdf ↗

New approach for obstacle avoidance in robotics using learned representations.

problem Challenges in sensor-based motion planning for new and dynamic environments.
method Proposes a new obstacle representation using PointNet architecture trained jointly with policies for obstacle avoidance.
result Significant improvements in accuracy and efficiency compared to state of the art.

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…

2018-04-02abs ↗pdf ↗

Improves drug properties using a novel LLM and reinforcement learning.

problem Optimizing drug properties while retaining chemical stability.
method Structured Policy Optimization (SPO) for fine-tuning a large language model.
result Enhanced drug properties across multiple target objectives.

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 …

2018-07-24abs ↗pdf ↗

This work tackles long-term visual planning by goal-conditioned hierarchical predictors.

problem Current learning approaches fail on long-horizon tasks due to lack of goal information and coarse-to-fine planning.
method Formulate goal-conditioned predictors (GCPs) and hierarchical models to predict trajectories between observations.
result GCPs enable effective long-term planning with much longer horizons than before.

FinVision uses LLM agents to predict stock markets by processing various financial data types.

problem Challenges in integrating diverse financial data for accurate stock market prediction.
method Multi-agent framework with LLMs specialized in different financial data types and a reflection module.
result The reflection module enhances decision-making capabilities for financial trading.

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…

2017-09-27abs ↗pdf ↗

This work defines a complexity measure for BAMDP planning and introduces state abstraction for more efficient approximate planning.

problem The computational intractability of exact BAMDP planning solutions.
method Define a complexity measure for BAMDP planning, introduce state abstraction, and develop an approximate planning algorithm.
result Introduces a computationally tractable approximate planning algorithm using state abstraction.