Understanding neural network sample complexity and interpretable convergence-guaranteed deep learning with polynomial regression

Antzeko izenburuak

• Analysis of employee stock options and guaranteed withdrawal benefits for life
  nork: Shah, Premal (Premal Y.)
  Argitaratua: (2009)
• Faster fully polynomial approximation schemes for Knapsack problems
  nork: Rhee, Donguk
  Argitaratua: (2015)
• Fully polynomial time approximation schemes for sequential decision problems
  nork: Mostagir, Mohamed
  Argitaratua: (2006)
• Regression under a modern optimization lens
  nork: King, Angela, Ph. D. Massachusetts Institute of Technology
  Argitaratua: (2015)
• Machine learning approaches to challenging problems : interpretable imbalanced classification, interpretable density estimation, and causal inference
  nork: Goh, Siong Thye
  Argitaratua: (2018)