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

1.7%3.5%5.2%7.0% · May 202619922001200920172026
48 results for Priority Dispatching Rules

Deep RL learns effective job shop scheduling rules from raw features.

problem Designing effective priority dispatching rules for job shop scheduling is challenging.
method End-to-end deep reinforcement learning using Graph Neural Networks.
result Agent learns high-quality dispatching rules from raw features and generalizes well to unseen instances.

Sparse oblique decision tree improves security rules for renewable power systems.

problem Identifying secure operating conditions in power systems with high renewable energy.
method Sparse weighted oblique decision tree to learn and embed linear security rules.
result The method significantly increases secure states and reduces solution time.

Enhances multi-project scheduling with multiple priority rules.

problem Resource allocation in multi-project scheduling with limited time and resources.
method Simulation-based approach using composite priority rules.
result Increased probability of finding schedules with shortest duration.

In distributed machine learning, data is dispatched to multiple machines for processing. Motivated by the fact that similar data points often belong to the same or similar classes, and more generally, classification rules of high accuracy tend to be "locally simple but globally complex" (Vapnik & Bottou 1993), we propo…

2015-12-15abs ↗pdf ↗

Efficient dispatching rule in manufacturing industry is key to ensure product on-time delivery and minimum past-due and inventory cost. Manufacturing, especially in the developed world, is moving towards on-demand manufacturing meaning a high mix, low volume product mix. This requires efficient dispatching that can wor…

2019-10-04abs ↗pdf ↗

A new method solves complex hydroelectricity planning problems.

problem Solving multistage stochastic linear programming for hydrothermal dispatch planning.
method Regularized Linear Decision Rules (AdaLASSO) to reduce overfitting and improve out-of-sample performance.
result Significant reductions in non-zero coefficients and improved spot-price profiles.

CoLA automates efficient numerical linear algebra for complex matrix structures.

problem Efficiently solving large-scale linear algebra problems with complex matrix structures.
method Combining linear operator abstraction with compositional dispatch rules.
result Automatic and efficient numerical algorithms for various linear algebra operations.

Optimal allocation of human effort to correct AI assessments in decision-making.

problem How to allocate costly human effort to correct noisy or biased AI-generated assessments.
method Decision-theoretic framework treating AI assessments as signals and human judgments as costly information. Developed estimation procedures under nonparametric and linear models.
result Our approach substantially outperforms LLM-only predictions and achieves performance comparable to full human review while using only 20-30% of the human information.

Modern vehicle fleets, e.g., for ridesharing platforms and taxi companies, can reduce passengers' waiting times by proactively dispatching vehicles to locations where pickup requests are anticipated in the future. Yet it is unclear how to best do this: optimal dispatching requires optimizing over several sources of unc…

2018-04-13abs ↗pdf ↗

Proposes a machine learning framework for more efficient economic dispatch.

problem Temporal and spatial correlations between system cost and load prediction errors.
method End-to-end machine learning approach with task-specific learning criteria and an efficient optimization kernel.
result Demonstrates the effectiveness and efficiency of the proposed learning framework.

VarPro selects features without model dependence, achieving balanced performance.

problem Finding a small set of features with high explanatory power.
method Rule-based variable priority approach, avoiding model-specific methods and artificial data.
result VarPro has a consistent filtering property for noise variables and achieves balanced performance.

Modeling intraday dispatch for wind-battery assets to meet grid targets.

problem Meeting grid targets for wind-battery assets in an intraday context.
method Developed a mathematical model with closed-form solutions and a novel algorithm for stochastic control.
result Calibrated model to 140+ wind-battery assets in Texas, demonstrating economic benefits.

This paper describes Convex, a convex optimization modeling framework in Julia. Convex translates problems from a user-friendly functional language into an abstract syntax tree describing the problem. This concise representation of the global structure of the problem allows Convex to infer whether the problem complies …

2014-10-17abs ↗pdf ↗

We aim to predict and explain service failures in supply-chain networks, more precisely among last-mile pickup and delivery services to customers. We analyze a dataset of 500,000 services using (1) supervised classification with Random Forests, and (2) Association Rules. Our classifier reaches an average sensitivity of…

2018-10-20abs ↗pdf ↗

ARMS automates fraud detection rules to improve efficiency and accuracy.

problem Maintaining effective fraud detection rules over time and reducing manual review.
method ARMS uses heuristic search and a user-defined loss-function to optimize and manage rules.
result ARMS can maintain original systems' performance with only a fraction of the rules.

Paper uses DRL for smart MG energy dispatch, improving stability and performance.

problem Improving energy dispatch in IoT-driven smart MGs with DGs, PVs, and batteries.
method Formulated POMDP model, proposed FH-DDPG and FH-RDPG algorithms, compared with baseline algorithms.
result Proposed algorithms enhance MG performance and stability under uncertainty.

The paper analyzes transaction fees on blockchains using a priority queue model.

problem Understanding and optimizing transaction fees on blockchain networks.
method An M/G^K/1 priority queue model is used to analyze transaction fees and user behavior.
result New insights into the dynamics of transaction fees and their impact on user behavior are provided.

DiffOPF solves multi-valued OPF problems by sampling from system history.

problem Multi-valued and non-convex OPF problems due to system parameter variability.
method DiffOPF treats OPF as a conditional sampling problem, learning from historical data.
result DiffOPF enables statistically credible warm starts with favorable cost and constraint satisfaction trade-offs.

GraSP-RL uses graph neural networks to improve job shop scheduling.

problem Capturing machine-unit-job sequence relationships and managing state space growth.
method Graph neural networks for feature extraction, reinforcement learning for decision-making, decentralized optimization.
result GraSP-RL outperforms existing methods in minimizing makespan for complex production environments.

Blockchain markets with paid-priority trading can lead to biased prices and reduced liquidity.

problem Discrete clearing and paid-priority in blockchain markets lead to biased prices and reduced liquidity.
method Developed a model to evaluate the viability of blockchain markets under discrete clearing and paid-priority.
result Paid-priority ordering induces endogenous selection, leading to biased prices and reduced liquidity.

Optimal trading strategy between CEXs and DEXs with priority fees and stochastic delays.

problem Managing latency risk in trading between centralized and decentralized exchanges.
method Developed a mixed control framework combining absolutely continuous controls with impulse interventions, allowing for stochastic execution delays and multiple pending orders.
result Optimal priority fee selection significantly outperforms non-strategic fee selection.

The paper examines clearing payments in financial networks to prevent cascaded defaults.

problem Cascaded defaults in financial networks under the proportionality rule.
method Analysis of clearing model under pro-rated payments, derivation of necessary and sufficient conditions for clearing payments, convex optimization problems for computation.
result Clearing payments can be computed by solving convex optimization problems, reducing overall system loss by lifting the proportionality rule.

Paper proposes MAMRL for efficient energy dispatch in self-powered edge computing systems.

problem High energy consumption in self-powered edge computing systems.
method Developed a semi-distributed data-driven MAMRL framework to solve a two-stage linear stochastic programming problem.
result The proposed MAMRL framework reduces up to 11% non-renewable energy usage and 22.4% energy cost.

Designs for allocating resources to prioritize needy applicants while estimating treatment effects.

problem Resource allocation under uncertainty with prioritized queues.
method Priority-queue randomization for treatment assignment and estimation of treatment effects.
result Identification of causal effects under different arrival and treatment assignment scenarios.

New approach uses deep reinforcement learning for vehicle dispatching, reducing waiting times.

problem Dynamic vehicle dispatching problem in various contexts.
method Event-based semi-Markov decision process with deep q-learning.
result Deep reinforcement learning policies outperform heuristic methods in New York City data.

Neural networks learn clean data patterns first, then noisy data, leading to improved performance initially but deteriorating later.

problem Improvement in prediction error on clean data during early training of neural networks with noisy labels.
method Theoretical analysis and experiments to explore the dynamics of gradient descent and the impact of clean and noisy data.
result Neural networks prioritize learning clean data patterns first, leading to improved performance initially but deteriorating later due to diminishing gradient dominance of clean samples over noisy ones.

Proposes a new method for feature selection using Bayesian ID with intervention.

problem Feature selection in data with varying importance.
method Probabilistic model for interpolative decomposition with Bayesian inference and Gibbs sampling.
result The proposed Bayesian ID algorithm with intervention selects features with higher priority and comparable reconstructive errors.

New findings challenge the importance of forecast accuracy in battery storage optimization, highlighting the role of rank correlation instead.

problem The challenge of optimizing battery storage dispatch decisions in multi-market electricity trading using forecast accuracy metrics.
method A hierarchical three-layer optimization system trading in multiple markets (FCR, aFRR, day-ahead, intraday) with real market data.
result Rank correlation (Kendall tau) is a better predictor of intraday dispatch value than forecast accuracy (MAE), with a threshold of tau around 0.85-0.95 capturing up to 97-100% of perfect-foresight revenue.

A learning-based algorithm optimizes admission control in a queuing system.

problem Optimizing admission decisions in a queuing system with unknown parameters.
method Proposes a learning-based dispatching algorithm to minimize regret compared to optimal policies.
result Achieves optimal regret bounds for different scenarios of unknown parameters.

Improved forecast accuracy for energy systems through decision-focused fine-tuning.

problem Challenges in integrating forecast values into time series models for diverse and specific instances.
method Decision-focused fine-tuning within time series foundation models for dispatchable feeder optimization.
result Improvement of 9.45% in average total daily costs.

We address the problem of assisting human dispatchers in operating power grids in today's changing context using machine learning, with theaim of increasing security and reducing costs. Power networks are highly regulated systems, which at all times must meet varying demands of electricity with a complex production sys…

2017-09-27abs ↗pdf ↗

Paper benchmarks and customizes energy forecasting methods.

problem Energy forecasting challenges and differences from traditional time series.
method Collected large-scale load datasets and renewable energy datasets. Developed feature engineering and customized loss functions.
result Comprehensive evaluation of 21 forecasting methods in energy datasets.

The paper proposes a method to infer multi-objective rewards from preferences.

problem Modeling preferences based on multiple, often competing objectives.
method Modeling priorities lexicographically and inferring multi-objective rewards from observed preferences.
result Lexicographically-ordered rewards provide a better understanding of preferences and improve policies.

The paper models blockchain queues and trading dynamics, finding conditions for transaction priority and price impact.

problem Understanding and predicting price impacts in blockchain trading environments.
method Developed a probabilistic model for blockchain queues with adversarial scheduling, derived expressions for transaction priority and price impact.
result Conditions for transaction priority and statistical models for price impact in blockchain trading environments.

GP CC-OPF solves uncertain power grid optimization with Gaussian Process.

problem Uncertainty in power grid operations due to high renewables integration.
method Data-driven Gaussian Process regression for solving non-convex CC-OPF problem.
result Effective economic dispatch optimization in uncertain power grids.

A new method for optimizing hierarchical multi-objective problems.

problem Symmetry and neglect of objective hierarchy in existing multi-objective methods.
method Priority-Constrained Descent (PCD) framework exploiting hierarchical objective structures.
result Pareto dominance and better per-objective performance with secondary progress guarantees.

Study callable convertible bonds with liquidity constraints, generalizing previous work.

problem Callable convertible bond problem with liquidity constraints.
method Introduced a new technique to handle non-ordered payoff situations.
result Complete solution to callable convertible bond problem with liquidity constraint.