List-Decodable Mean Estimation in Nearly-PCA Time

Nov-14-2025, 04:11:36 GMT–Neural Information Processing Systems

Our main result is a new algorithm for bounded covariance distributions with optimal sample complexity and near-optimal error guarantee, running in nearly-PCA time .

algorithm, artificial intelligence, machine learning, (18 more...)

Neural Information Processing Systems

Nov-14-2025, 04:11:36 GMT

Conferences PDF

Add feedback

Country:
- Asia > Afghanistan
  - Parwan Province > Charikar (0.04)
- Europe > Greece
  - Ionian Islands > Corfu (0.04)
- North America
  - Canada
    - British Columbia > Vancouver (0.04)
    - Quebec > Montreal (0.04)
  - United States
    - Arizona > Maricopa County
      - Phoenix (0.04)
    - California
      - Los Angeles County > Los Angeles (0.14)
      - San Diego County
        La Jolla (0.04)
        San Diego (0.04)
      - Santa Clara County
        Palo Alto (0.04)
        Stanford (0.04)
    - Illinois > Cook County
      - Chicago (0.04)
    - Massachusetts (0.04)
    - North Carolina > Durham County
      - Durham (0.04)
    - Wisconsin > Dane County
      - Madison (0.14)
- Oceania > Australia
  - New South Wales > Sydney (0.04)

Technology:
- Information Technology
  - Artificial Intelligence > Machine Learning (1.00)
  - Data Science (1.00)

Duplicate Docs Excel Report

Title
List-Decodable Mean Estimation in Nearly-PCA Time

Similar Docs Excel Report more

Title	Similarity	Source
None found