Online Convex Optimization with Stochastic Constraints

Oct-4-2024, 07:35:47 GMT–Neural Information Processing Systems

This paper considers online convex optimization (OCO) with stochastic constraints, which generalizes Zinkevich's OCO over a known simple fixed set by introducing multiple stochastic functional constraints that are i.i.d.

algorithm 1, constraint, constraint violation, (13 more...)

Neural Information Processing Systems

Oct-4-2024, 07:35:47 GMT

Conferences PDF

Add feedback

Country:
- Europe > United Kingdom
  - England > Cambridgeshire > Cambridge (0.04)
- North America > United States
  - California > Los Angeles County
    - Long Beach (0.04)
  - New York (0.05)

Technology:
- Information Technology > Artificial Intelligence
  - Machine Learning (1.00)
  - Representation & Reasoning > Constraint-Based Reasoning (0.76)

Duplicate Docs Excel Report

Title
Online Convex Optimization with Stochastic Constraints
Online Convex Optimization with Stochastic Constraints

Similar Docs Excel Report more

Title	Similarity	Source
None found