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,742 papers · 148 categories

Trend · papers per month

154307461614 · Jun 202019922001200920172026
48 results for action prediction

We enhance conformal prediction for risk-averse decisions with action-conditional guarantees.

problem Uncertainty quantification and safety guarantees for machine learning decisions.
method Action-conditional conformal prediction, pinball-loss minimization.
result Action-conditional prediction sets optimize risk-averse decision-making.

Method predicts future rewards from past actions in a linear Gaussian system.

problem Maximizing cumulative reward in a stochastic multi-armed bandit with linear Gaussian dynamics.
method Proposes a method using a modified Kalman filter to predict future rewards based on past rewards.
result Reward from any action can be used to predict another action's future reward.

Hybridizes CEM and gradient descent for efficient model-predictive control.

problem Efficiently planning optimal action sequences in high-dimensional spaces.
method Interleaves Cross-Entropy Method (CEM) and gradient descent steps.
result Faster convergence and avoidance of local optima compared to CEM.

Intelligent agents can learn to represent the action spaces of other agents simply by observing them act. Such representations help agents quickly learn to predict the effects of their own actions on the environment and to plan complex action sequences. In this work, we address the problem of learning an agent's action…

2018-06-25abs ↗pdf ↗

A new reinforcement learning method reduces action complexity for robust control.

problem Deep reinforcement learning's susceptibility to spurious correlations.
method Minimizing trajectory entropy to encourage simple, predictable actions.
result Trajectory Entropy Reinforcement Learning achieves superior performance and robustness.

Financial institutions use LSTM models to predict customer goals.

problem Predicting customer goals and actions in financial services.
method Used LSTM models with state-space graph embeddings on historical customer traces.
result Demonstrated the effectiveness of LSTM models in predicting customer goals and actions.

Decision-makers are faced with the challenge of estimating what is likely to happen when they take an action. For instance, if I choose not to treat this patient, are they likely to die? Practitioners commonly use supervised learning algorithms to fit predictive models that help decision-makers reason about likely futu…

2017-03-30abs ↗pdf ↗

PredNet, a deep predictive coding network developed by Lotter et al., combines a biologically inspired architecture based on the propagation of prediction error with self-supervised representation learning in video. While the architecture has drawn a lot of attention and various extensions of the model exist, there is …

2019-06-14abs ↗pdf ↗

We introduce a method for learning the dynamics of complex nonlinear systems based on deep generative models over temporal segments of states and actions. Unlike dynamics models that operate over individual discrete timesteps, we learn the distribution over future state trajectories conditioned on past state, past acti…

2017-03-12abs ↗pdf ↗

Procedure verifies if machine learning models assign fixed predictions that preclude access.

problem Models assign fixed predictions that preclude access to credit and employment.
method Model-agnostic recourse verification with reachable sets.
result Models can inadvertently preclude access by assigning fixed predictions.

Optimizes predictions for specific tasks using parametrized decision analysis.

problem Optimizing predictions for specific decision tasks of interest.
method Designs a class of parametrized actions for Bayesian decision analysis.
result Derives efficient and interpretable solutions for various action parametrizations and loss functions.

Deep network predicts action sequences for complex tasks from a scene image.

problem Scalable task and motion planning from initial scene images.
method Deep convolutional recurrent neural network that predicts action sequences.
result Predicts promising action sequences, reducing motion planning problems.

Neural Assistant integrates knowledge reasoning and dialogue generation in a single model.

problem Challenges in task-oriented dialog systems, including multi-turn language understanding and generation, knowledge retrieval and reasoning, and action prediction.
method Develops a single neural network model that jointly predicts text responses and actions from conversation history and external knowledge.
result The model learns to reason on external knowledge with weak supervision, improving factual accuracy and language generation performance.

Proposes a new algorithm for accurate tree-based models with guaranteed recourse actions.

problem Ensuring recourse actions for models optimized for predictive performance.
method Formulates and solves an optimization task to ensure reasonable actions for as many instances as possible, using adversarial training techniques.
result Successfully provided reasonable actions to more instances than baselines without significantly degrading accuracy and computational efficiency.

A new model predicts conversion rates by analyzing post-click actions.

problem Challenges in predicting conversion rates due to sample selection bias and data sparsity.
method Post-click behavior decomposition and multi-task learning.
result The model effectively addresses sample selection bias and data sparsity issues.

The Prescriptive Canvas improves business outcomes by directly prescribing actions based on predictions.

problem Sub-optimal performance in business projects due to a two-step approach of prediction and decision-making.
method The Prescriptive Canvas methodology for framing and communicating actions directly based on predictions.
result Improves framing and communication across stakeholders for successful business impact.

User intended actions are widely seen in many areas. Forecasting these actions and taking proactive measures to optimize business outcome is a crucial step towards sustaining the steady business growth. In this work, we focus on pre- dicting attrition, which is one of typical user intended actions. Conventional attriti…

2018-10-11abs ↗pdf ↗

Predictive State Representations (PSRs) are an expressive class of models for controlled stochastic processes. PSRs represent state as a set of predictions of future observable events. Because PSRs are defined entirely in terms of observable data, statistically consistent estimates of PSR parameters can be learned effi…

2013-09-26abs ↗pdf ↗

Predicts next actions in soccer possessions using path signatures.

problem Predicting next actions in soccer possessions with high accuracy.
method Leveraging path signatures to encode spatio-temporal structure of recent possessions, avoiding manual feature engineering.
result Our approach outperforms transformer-based benchmarks across various loss metrics and reduces computational cost.

New model predicts drug effects across various cell types using causal imputation.

problem Predict drug effects across different cell types given limited data.
method Introduces a novel SCM-based model class with latent factor structure and uses Synthetic Interventions estimator.
result Method outperforms other matrix completion approaches in drug repurposing dataset.

Policy Prediction Network improves continuous control problems with model-free and model-based learning.

problem Improving sample complexity and performance in continuous control problems.
method Integrates model-free and model-based reinforcement learning, introduces implicit model-based learning for continuous action space.
result First to introduce implicit model-based learning to Policy Gradient algorithms for continuous action space.

It has long been assumed that high dimensional continuous control problems cannot be solved effectively by discretizing individual dimensions of the action space due to the exponentially large number of bins over which policies would have to be learned. In this paper, we draw inspiration from the recent success of sequ…

2017-05-14abs ↗pdf ↗

Autoencoder learns group representations from actions, improving future prediction accuracy.

problem Learning internal models of interactions with the real world.
method Homomorphism autoencoder with group representation trained on equivariance-derived loss.
result Agents can predict future actions with improved accuracy.

UWM-JEPA predicts future scenarios in belief space, improving accuracy in partially observed environments.

problem Predicting future scenarios in partially observed environments with uncertainty.
method Introduces UWM-JEPA, a JEPA world model with a density-matrix latent and learned unitary predictor.
result UWM-JEPA achieves 0.77 accuracy on a hidden-velocity indicator task, outperforming LSTM-JEPA.

This review covers methods for autonomous driving including tracking, prediction, and decision making.

problem Improving autonomous driving through better tracking, prediction, and decision making.
method Approaches based on neural networks, stochastic techniques, and reinforcement learning are discussed.
result Effective methods for autonomous driving are identified and compared.

New method combines heuristics and search techniques to speed up cooperative planning for autonomous vehicles.

problem Efficient cooperative planning for autonomous vehicles in complex traffic scenarios.
method Combining learned heuristics with Monte Carlo Tree Search (MCTS) to guide search towards promising actions.
result Better solutions at lower computational costs achieved through accelerated planning.

Reinforcement learning methods require careful design involving a reward function to obtain the desired action policy for a given task. In the absence of hand-crafted reward functions, prior work on the topic has proposed several methods for reward estimation by using expert state trajectories and action pairs. However…

2018-06-02abs ↗pdf ↗

Action chunking and data exploration improve behavior cloning in robotics.

problem Exponential errors in learning from demonstrations for continuous control tasks.
method Action chunking and exploratory data collection.
result Control-theoretic stability is key to improving imitation learning.

We propose a Variational Time Series Feature Extractor (VTSFE), inspired by the VAE-DMP model of Chen et al., to be used for action recognition and prediction. Our method is based on variational autoencoders. It improves VAE-DMP in that it has a better noise inference model, a simpler transition model constraining the …

2018-07-06abs ↗pdf ↗

Develops optimal decision-making framework for uncertain counterfactuals.

problem Ensuring reliability of predictions in high-stakes decisions.
method Policy-Coupled Risk-Averse Conformal Prediction (PC-RACP).
result Optimal prediction sets for counterfactual decisions with valid coverage.

FATE predicts user engagement on social apps with explainable explanations.

problem Accurate user engagement prediction for social apps with explainability.
method FATE, a flexible neural framework incorporating friendships, actions, and temporal dynamics.
result FATE outperforms state-of-the-art approaches by 10% error and 20% runtime reduction.

CoverNet predicts urban driving trajectories using diverse sets of possible actions.

problem Multimodal probabilistic trajectory prediction for urban driving.
method Frame trajectory prediction as classification over a diverse set of trajectories; dynamically generate sets based on current state.
result Outperforms state-of-the-art methods on real-world self-driving datasets.

New method minimizes decision errors in large treatment spaces.

problem Improving decision-making in large treatment spaces with biased observational data.
method Loss minimizes classification error of actions in large action space.
result Proves improved decision-making performance in large combinatorial action spaces.

CAN approximates explicit feature interactions for CTR prediction.

problem Learning explicit feature interactions from sparse features.
method Co-Action Network approximates explicit pairwise feature interactions without introducing too many additional parameters.
result CAN outperforms state-of-the-art CTR models and the cartesian product method.