Robust Optimization for Non-Convex Objectives

Robert S. Chen, Brendan Lucier, Yaron Singer, Vasilis Syrgkanis

Nov-21-2025, 04:41:53 GMT–Neural Information Processing Systems

We consider robust optimization problems, where the goal is to optimize in the worst case over a class of objective functions.

artificial intelligence, machine learning, optimization, (16 more...)

Neural Information Processing Systems

Nov-21-2025, 04:41:53 GMT

Conferences PDF

Country:
- Asia > Singapore (0.04)
- North America
  - United States > California
    - San Francisco County > San Francisco (0.15)
    - San Diego County > San Diego (0.04)
    - Los Angeles County > Long Beach (0.04)
  - Canada
    - Quebec > Montreal (0.04)
    - British Columbia (0.04)
- Europe
  - Spain > Catalonia
    - Barcelona Province > Barcelona (0.14)
  - France > Île-de-France
    - Paris > Paris (0.04)

Genre:
- Research Report (0.70)

Technology:
- Information Technology > Artificial Intelligence
  - Representation & Reasoning > Optimization (0.66)
  - Machine Learning
    - Statistical Learning (1.00)
    - Neural Networks (1.00)

Duplicate Docs Excel Report

Title
Robust Optimization for Non-Convex Objectives
Robust Optimization for Non-Convex Objectives

Similar Docs Excel Report more

Title	Similarity	Source
None found