Convexity and Lipschitz Hessian: Minimax Sample Complexity

Oct-10-2025, 13:56:43 GMT–Neural Information Processing Systems

We provide the first tight characterization for the rate of the minimax simple regret by developing matching upper and lower bounds.

algorithm, inequality, optimization, (14 more...)

Neural Information Processing Systems

Oct-10-2025, 13:56:43 GMT

Conferences PDF

Country:
- Europe > United Kingdom
  - England > Cambridgeshire > Cambridge (0.04)
- North America > United States
  - California
    - Alameda County > Berkeley (0.04)
    - Santa Barbara County > Santa Barbara (0.04)
  - Florida > Broward County
    - Fort Lauderdale (0.04)
  - New Jersey > Mercer County
    - Princeton (0.04)
  - Texas (0.04)

Genre:
- Research Report > Experimental Study (0.93)

Technology:
- Information Technology > Artificial Intelligence
  - Machine Learning (1.00)
  - Representation & Reasoning
    - Optimization (0.46)
    - Search (0.61)

Duplicate Docs Excel Report

Title
Convexity and Lipschitz Hessian: Minimax Sample Complexity

Similar Docs Excel Report more

Title	Similarity	Source
None found