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

74149223297 · Jun 202019922001200920172026
48 results for Decision Flow

A new MDP with Bandits approach for sequential decision making in linear-flow scenarios.

problem Sequential decision making with limited feedback in a linear-flow context.
method Formulated as an MDP with Bandits, using Thompson sampling for action selection and exact dynamic programming for allocation.
result The proposed MDP with Bandits algorithm outperforms other methods in sequential decision making.

PO-Flow models potential and counterfactual outcomes for personalized treatment decisions.

problem Predicting individualized treatment effects from observational data.
method Continuous normalizing flow (CNF) framework for causal inference.
result Unified approach to potential outcome prediction, treatment effect estimation, and counterfactual prediction.

A method for eliciting expert beliefs using preferential questions and normalizing flows.

problem Eliciting high-dimensional probability distributions from noisy judgments.
method Normalizing flows based on preferential questions with a novel functional prior.
result The method allows for the inference of arbitrarily flexible densities from preferential judgments.

Generative models help make decisions under changing data distributions.

problem Making decisions based on historical data when the actual data distribution changes.
method Flow- and score-based generative models to represent and transform distributions.
result Generative models can learn nominal uncertainty, create stressed distributions, and produce conditional distributions.

Decision-calibrated prediction sets improve power system operations by reducing unnecessary costs.

problem Balancing operating costs and reliability in power systems with renewable uncertainty.
method Learn conditional prediction sets as sub-level sets of norm-based score functions, calibrate uncertainty sets based on reliability of downstream decisions.
result Decision-calibrated sets lead to more efficient operations with smaller uncertainty sets and lower costs compared to standard coverage-based calibration.

Complete criterion for VoI in multi-decision influence diagrams established.

problem Analyzing safety and fairness properties of AI systems using influence diagrams.
method Introduced ID homomorphisms and Tree of Systems to prove properties of multi-decision influence diagrams.
result First complete graphical criterion for VoI in influence diagrams with multiple decisions.

Guided Flows enhance sample quality in conditional image generation and text-to-speech.

problem Improving sample quality in conditional generative models.
method Integrating classifier-free guidance into Flow Matching (FM) models for Continuous Normalizing Flows (CNFs).
result Guided Flows significantly improve sample quality in conditional image generation and text-to-speech synthesis.

FORBES learns flexible belief states for POMDPs using normalizing flows.

problem Accurately modeling belief states in POMDPs for high-dimensional, continuous spaces.
method Integrates normalizing flows into variational inference for continuous belief state learning.
result FORBES learns flexible belief states that enable multi-modal predictions and high-quality reconstructions.

Study shows policy gradient convergence for entropy-regularized MDPs with neural nets in mean-field regime.

problem Global convergence of policy gradient for entropy-regularized MDPs with neural network approximation.
method Softmax policy with neural network approximation in mean-field regime, gradient flow in 2-Wasserstein metric, exponential convergence under sufficient regularization.
result Gradient flow converges exponentially fast to the unique stationary solution under sufficient regularization.

Proposes method for eliciting non-parametric joint priors using normalizing flows.

problem Learning complex non-parametric joint priors for model parameters.
method Expert elicitation combined with normalizing flows for generative modeling.
result Framework supports elicitation of both parametric and non-parametric priors.

The paper tackles safe reinforcement learning with convex regularization.

problem Safe reinforcement learning in complex, high-dimensional settings with safety constraints.
method Doubly-regularized RL framework combining reward and parameter regularization, formulated as a convex regularized objective with parametrized policies on an infinite-dimensional statistical manifold.
result Exponential convergence guarantees under sufficient regularization, robust theoretical insights and guarantees for safe RL.

Attribution methods provide insights into the decision-making of machine learning models like artificial neural networks. For a given input sample, they assign a relevance score to each individual input variable, such as the pixels of an image. In this work we adapt the information bottleneck concept for attribution. B…

2020-01-02abs ↗pdf ↗

New framework uses OR to ensure AI systems make safe decisions.

problem Ensuring generative AI systems make safe decisions as they gain autonomy.
method Developed a conceptual framework combining flow-based models and adversarial robustness.
result Increased autonomy requires new OR approaches for feasibility, robustness, and stress testing.

Analyzes how learning algorithms affect and are affected by data manipulation.

problem Characterizing the closed-loop behavior of learning algorithms in the presence of decision-dependent data.
method Analyzes repeated risk minimization as perturbed gradient flows of performative risk minimization, considering multiple local minimizers.
result Characterizes the region of attraction for various equilibria and introduces performative alignment.

Study optimizes GCS operations with deep learning and reinforcement learning.

problem Maximizing storage performance in GCS with resource-efficient simulations.
method Introduces MLD model for fast flow prediction and well control optimization, combining deep learning and reinforcement learning.
result Achieves highest NPV while reducing computational resources by over 60%.

Paper shows how to quantify uncertainty in medical ML models.

problem Uncertainty in opaque ML models can lead to safety risks in medical applications.
method Introduces Uncertainty Wrapper to quantify uncertainty transparently.
result Demonstrates practical utility of Uncertainty Wrapper in flow cytometry.

To execute a trade, participants in electronic equity markets may choose to submit limit orders or market orders across various exchanges where a stock is traded. This decision is influenced by the characteristics of the order flow and queue sizes in each limit order book, as well as the structure of transaction fees a…

2012-10-05abs ↗pdf ↗

The paper proposes a new method for probabilistic load forecasting using Bernstein-Polynomial Normalizing Flows.

problem High variability in short-term load forecasting at the low-voltage level due to fluctuating demand and increasing electrification.
method Flexible conditional density forecasting based on Bernstein polynomial normalizing flows with neural network control.
result Density predictions outperform traditional methods for 24h-ahead load forecasting.

Hybrid model predicts flow and pressure in water systems.

problem Predicting flow and pressure in water distribution systems with complex spatial-temporal correlations.
method Hybrid dual-stage spatial-temporal attention-based recurrent neural networks (hDS-RNN).
result Our model outperformed 9 baseline models in flow and pressure series prediction.

Enhances GFlowNets with distributional approach for risk-sensitive policies.

problem Limited applicability of current GFlowNet framework in handling stochastic reward functions.
method Adopting a distributional paradigm, parameterizing each edge flow through quantile functions, and introducing a risk-sensitive learning algorithm.
result Significant improvement on benchmarks due to enhanced training algorithm, even in deterministic reward settings.

Paper bounds PAC RL sample complexity in deterministic MDPs.

problem Identify ε-optimal policy with high probability.
method Proposes nearly matching upper and lower bounds on sample complexity, introduces deterministic return gap, uses graph-theoretical concepts and maximum-coverage exploration.
result First nearly matching upper and lower bounds on sample complexity for PAC RL in deterministic MDPs.

Paper proposes hybrid machine learning for tuning first principles models in engineering systems.

problem Inaccurate first principles models in process engineering due to changing conditions.
method Hybrid machine learning framework using Bayesian Neural Networks.
result Uncertainty estimates improve operation decisions in multiphase flow modeling.

Low-rate application layer distributed denial of service (LDDoS) attacks are both powerful and stealthy. They force vulnerable webservers to open all available connections to the adversary, denying resources to real users. Mitigation advice focuses on solutions that potentially degrade quality of service for legitimate…

2019-03-12abs ↗pdf ↗

One fundamental issue in managing bike sharing systems is the bike flow prediction. Due to the hardness of predicting the flow for a single station, recent research works often predict the bike flow at cluster-level. While such studies gain satisfactory prediction accuracy, they cannot directly guide some fine-grained …

2018-07-28abs ↗pdf ↗

Investment decision triggered by a convex curve in a two-factor uncertainty model.

problem Optimal irreversible investment in a company with two products whose prices follow geometric Brownian motions.
method Two-dimensional optimal stopping problem, nonlinear integral equation, convex curve characterization.
result Optimal investment decision is characterized by a convex curve, unique solution to a nonlinear integral equation.

Softmax policy gradient achieves global optimality in wide neural networks with entropy regularization.

problem Optimizing softmax policies with neural networks in the mean-field regime.
method Modeling neural networks as Wasserstein gradient flows and proving global optimality of fixed points.
result Global optimality of softmax policy gradient in wide single hidden layer neural networks with entropy regularization.

LLMs fail to match statistical ground truth despite stable run-to-run performance.

problem LLMs lack validation against statistical ground truth in automated scientific workflows.
method Introduced a behavioral evaluation framework for LLMs, separating four decision-making dimensions.
result LLMs can exhibit near-perfect stability but diverge from statistical ground truth.

A novel framework extracts essential factors from order flow data for high-frequency trading.

problem Challenges in extracting and utilizing order flow data due to its large volume and limitations of traditional techniques.
method Proposes a Context Encoder and Factor Extractor for unsupervised learning of important signals from order flow data.
result Extracts superior factors from order flow data, improving stock trend prediction and order execution tasks.