Pith. Sign in

RECORD

Statistical Learning for Probability-Constrained Stochastic Optimal Control

Optimization and Control · Submitted 30 Apr 2019

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Our algorithms offer an efficient and reliable extension of RMC to probability-constrained control.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1905.00107 (version 2)
Pith IDF2MLT5GB, Pith's permanent record of this paper and its review
CitationAditya Maheshwari, Alessandro Balata, Jan Palczewski, Michael Ludkovski. "Statistical Learning for Probability-Constrained Stochastic Optimal Control." arXiv:1905.00107 (2019). https://pith.science/paper/F2MLT5GB
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 5,493 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.08 · human participants 0.02 · controlled comparison 0.22 · randomized assignment 0.02 · states quantitative result 0.05 · compares with prior results 0.67 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

We investigate Monte Carlo based algorithms for solving stochastic control problems with probabilistic constraints. Our motivation comes from microgrid management, where the controller tries to optimally dispatch a diesel generator while maintaining low probability of blackouts. The key question we investigate are empirical simulation procedures for learning the admissible control set that is specified implicitly through a probability constraint on the system state. We propose a variety of relevant statistical tools including logistic regression, Gaussian process regression, quantile regression and support vector machines, which we then incorporate into an overall Regression Monte Carlo (RMC) framework for approximate dynamic programming. Our results indicate that using logistic or Gaussian process regression to estimate the admissibility probability outperforms the other options. Our algorithms offer an efficient and reliable extension of RMC to probability-constrained control. We illustrate our findings with two case studies for the microgrid problem.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We investigate Monte Carlo based algorithms for solving stochastic control problems with probabilistic constraints. contribution 0.88 0.79 0.04 asserted 0.74
s1 Our motivation comes from microgrid management, where the controller tries to optimally dispatch a diesel generator while maintaining low probability of blackouts. background 1.00 0.17 0.02 asserted 0.98
s2 The key question we investigate are empirical simulation procedures for learning the admissible control set that is specified implicitly through a probability constraint on the system state. background 0.42 0.29 0.03 asserted 0.53
s3 We propose a variety of relevant statistical tools including logistic regression, Gaussian process regression, quantile regression and support vector machines, which we then incorporate into an overall Regression Monte Carlo (RMC) framework for approximate dynamic programming. method 0.81 0.91 0.07 asserted 1.00
s4 Our results indicate that using logistic or Gaussian process regression to estimate the admissibility probability outperforms the other options. result 1.00 0.96 0.47 hedged possibility 0.86
s5 Our algorithms offer an efficient and reliable extension of RMC to probability-constrained control. interpretation 0.68 0.82 0.56 asserted 1.00
s6 We illustrate our findings with two case studies for the microgrid problem. contribution 0.66 0.88 0.05 asserted 0.99

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We investigate Monte Carlo based algorithms for solving stochastic control problems with probabilistic constraints. Our motivation comes from microgrid management, where the controller tries to optimally dispatch a diesel generator while maintaining low probability of blackouts. The key question we investigate are empirical simulation procedures for learning the admissible control set that is specified implicitly through a probability constraint on the system state. We propose a variety of relevant statistical tools including logistic regression, Gaussian process regression, quantile regression and support vector machines, which we then incorporate into an overall Regression Monte Carlo (RMC) framework for approximate dynamic programming. Our results indicate that using logistic or Gaussian process regression to estimate the admissibility probability outperforms the other options. Our algorithms offer an efficient and reliable extension of RMC to probability-constrained control. We illustrate our findings with two case studies for the microgrid problem.

Human review
How the literature uses it

1 arXiv paper cite this in 1 sentence

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 1 sentence without a confident label

Builds on 1 paper
Cites as background 2 papers

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.