pith. sign in

Amin Karbasi

Identifiers

  • name variant Amin Karbasi 0.60 · backfill

Papers (43)

  1. Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity cs.LG · 2019 · author #5
  2. Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications cs.DS · 2019 · author #4
  3. Quantized Frank-Wolfe: Faster Optimization, Lower Communication, and Projection Free cs.LG · 2019 · author #5
  4. Adaptive Sequence Submodularity cs.LG · 2019 · author #5
  5. Unconstrained Submodular Maximization with Constant Adaptive Complexity cs.DS · 2018 · author #3
  6. Eliminating Latent Discrimination: Train Then Mask cs.LG · 2018 · author #3
  7. Data Summarization at Scale: A Two-Stage Submodular Approach cs.LG · 2018 · author #4
  8. Projection-Free Bandit Convex Optimization stat.ML · 2018 · author #3
  9. Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization math.OC · 2018 · author #3
  10. Submodularity on Hypergraphs: From Sets to Sequences cs.DS · 2018 · author #4
  11. Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity stat.ML · 2018 · author #4
  12. Do Less, Get More: Streaming Submodular Maximization with Subsampling cs.LG · 2018 · author #2
  13. Comparison Based Learning from Weak Oracles cs.LG · 2018 · author #4
  14. Online Continuous Submodular Maximization stat.ML · 2018 · author #3
  15. Decentralized Submodular Maximization: Bridging Discrete and Continuous Settings math.OC · 2018 · author #3
  16. Deletion-Robust Submodular Maximization at Scale cs.LG · 2017 · author #3
  17. Conditional Gradient Method for Stochastic Submodular Maximization: Closing the Gap math.OC · 2017 · author #3
  18. Gradient Methods for Submodular Maximization cs.LG · 2017 · author #3
  19. Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? cs.DM · 2017 · author #3
  20. Greed is Good: Near-Optimal Submodular Maximization via Greedy Optimization cs.LG · 2017 · author #3
  21. Streaming Weak Submodularity: Interpreting Neural Networks on the Fly stat.ML · 2017 · author #4
  22. Estimating the Size of a Large Network and its Communities from a Random Sample stat.ML · 2016 · author #2
  23. Tradeoffs for Space, Time, Data and Risk in Unsupervised Learning stat.ML · 2016 · author #3
  24. Submodular Variational Inference for Network Reconstruction cs.LG · 2016 · author #3
  25. Near-Optimal Active Learning of Halfspaces via Query Synthesis in the Noisy Setting cs.AI · 2016 · author #3
  26. Seeing the Unseen Network: Inferring Hidden Social Ties from Respondent-Driven Sampling cs.SI · 2015 · author #3
  27. Fast Mixing for Discrete Point Processes stat.ML · 2015 · author #2
  28. Distributed Submodular Maximization cs.LG · 2014 · author #2
  29. Lazier Than Lazy Greedy cs.LG · 2014 · author #3
  30. Convolutional Neural Associative Memories: Massive Capacity with Noise Tolerance cs.NE · 2014 · author #1
  31. Noise Facilitation in Associative Memories of Exponential Capacity cs.NE · 2014 · author #1
  32. Near Optimal Bayesian Active Learning for Decision Making cs.LG · 2014 · author #3
  33. Near-Optimally Teaching the Crowd to Classify cs.LG · 2014 · author #4
  34. Neural Networks Built from Unreliable Components cs.NE · 2013 · author #1
  35. Coupled Neural Associative Memories cs.NE · 2013 · author #1
  36. Multi-Level Error-Resilient Neural Networks with Learning cs.NE · 2012 · author #2
  37. Robust Localization from Incomplete Local Information cs.NI · 2011 · author #1
  38. From Small-World Networks to Comparison-Based Search cs.LG · 2011 · author #1
  39. Calibration Using Matrix Completion with Application to Ultrasound Tomography cs.LG · 2010 · author #2
  40. Group Testing with Probabilistic Tests: Theory, Design and Application cs.IT · 2010 · author #3
  41. Graph-Constrained Group Testing cs.DM · 2010 · author #2
  42. An Estimation Theoretic Approach for Sparsity Pattern Recovery in the Noisy Setting cs.IT · 2009 · author #2
  43. Compressed Sensing with Probabilistic Measurements: A Group Testing Solution cs.IT · 2009 · author #3

Mentions

  • 1411.0541 #2 · backfill · confidence 0.70 Amin Karbasi
  • 1409.7938 #3 · backfill · confidence 0.70 Amin Karbasi
  • 1407.6513 #1 · backfill · confidence 0.70 Amin Karbasi
  • 1403.3305 #1 · backfill · confidence 0.70 Amin Karbasi
  • 1402.5886 #3 · backfill · confidence 0.70 Amin Karbasi
  • 1402.2092 #4 · backfill · confidence 0.70 Amin Karbasi
  • 1301.6265 #1 · backfill · confidence 0.70 Amin Karbasi
  • 1301.1555 #1 · backfill · confidence 0.70 Amin Karbasi
  • 1202.2770 #2 · backfill · confidence 0.70 Amin Karbasi
  • 1110.3018 #1 · backfill · confidence 0.70 Amin Karbasi
  • 1107.3059 #1 · backfill · confidence 0.70 Amin Karbasi
  • 1012.4928 #2 · backfill · confidence 0.70 Amin Karbasi
  • 1009.3186 #3 · backfill · confidence 0.70 Amin Karbasi
  • 1001.1445 #2 · backfill · confidence 0.70 Amin Karbasi
  • 0911.4880 #2 · backfill · confidence 0.70 Amin Karbasi
  • 0909.3508 #3 · backfill · confidence 0.70 Amin Karbasi

Frequent Coauthors