ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1802.10575
  4. Cited By
Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation
  of Multivariate Log-concave Densities

Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities

28 February 2018
Timothy Carpenter
Ilias Diakonikolas
Anastasios Sidiropoulos
Alistair Stewart
ArXivPDFHTML

Papers citing "Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities"

3 / 3 papers shown
Title
A Sequential Test for Log-Concavity
A Sequential Test for Log-Concavity
Aditya Gangrade
Alessandro Rinaldo
Aaditya Ramdas
30
12
0
09 Jan 2023
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via
  Locally Exponential Families
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families
Brian Axelrod
Ilias Diakonikolas
Anastasios Sidiropoulos
Alistair Stewart
Gregory Valiant
33
8
0
18 Jul 2019
Learning mixtures of structured distributions over discrete domains
Learning mixtures of structured distributions over discrete domains
Siu On Chan
Ilias Diakonikolas
Rocco A. Servedio
Xiaorui Sun
73
83
0
02 Oct 2012
1