Amin Karbasi

According to our database1, Amin Karbasi authored at least 105 papers between 2006 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Submodularity in Action: From Machine Learning to Signal Processing Applications.
IEEE Signal Process. Mag., 2020

Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization.
SIAM J. Optim., 2020

Individualized functional networks reconfigure with cognitive state.
NeuroImage, 2020

There is no single functional atlas even for a single individual: Functional parcel definitions change with task.
NeuroImage, 2020

Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization.
J. Mach. Learn. Res., 2020

Simultaneous Greedys: A Swiss Army Knife for Constrained Submodular Maximization.
CoRR, 2020

Multiple Descent: Design Your Own Generalization Curve.
CoRR, 2020

Safe Learning under Uncertain Objectives and Constraints.
CoRR, 2020

Meta Learning in the Continuous Time Limit.
CoRR, 2020

The Curious Case of Adversarially Robust Models: More Data Can Help, Double Descend, or Hurt Generalization.
CoRR, 2020

Regularized Submodular Maximization at Scale.
CoRR, 2020

Continuous Submodular Maximization: Beyond DR-Submodularity.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Online MAP Inference of Determinantal Point Processes.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Submodular Maximization Through Barrier Functions.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Streaming Submodular Maximization under a k-Set System Constraint.
Proceedings of the 37th International Conference on Machine Learning, 2020

More Data Can Expand The Generalization Gap Between Adversarially Robust and Standard Models.
Proceedings of the 37th International Conference on Machine Learning, 2020

One Sample Stochastic Frank-Wolfe.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Quantized Frank-Wolfe: Faster Optimization, Lower Communication, and Projection Free.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Black Box Submodular Maximization: Discrete and Continuous Settings.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Adaptivity in Adaptive Submodularity.
CoRR, 2019

Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition.
CoRR, 2019

Batched Multi-Armed Bandits with Optimal Regret.
CoRR, 2019

Stochastic Conditional Gradient++.
CoRR, 2019

Quantized Frank-Wolfe: Communication-Efficient Distributed Optimization.
CoRR, 2019

Unconstrained submodular maximization with constant adaptive complexity.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Adaptive Sequence Submodularity.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Stochastic Continuous Greedy ++: When Upper and Lower Bounds Match.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications.
Proceedings of the 36th International Conference on Machine Learning, 2019

Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity.
Proceedings of the 36th International Conference on Machine Learning, 2019

Projection-Free Bandit Convex Optimization.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

Eliminating Latent Discrimination: Train Then Mask.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
An exemplar-based approach to individualized parcellation reveals the need for sex specific functional networks.
NeuroImage, 2018

Learning neural connectivity from firing activity: efficient algorithms with provable guarantees on topology.
J. Comput. Neurosci., 2018

Do Less, Get More: Streaming Submodular Maximization with Subsampling.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Decentralized Submodular Maximization: Bridging Discrete and Continuous Settings.
Proceedings of the 35th International Conference on Machine Learning, 2018

Data Summarization at Scale: A Two-Stage Submodular Approach.
Proceedings of the 35th International Conference on Machine Learning, 2018

Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity.
Proceedings of the 35th International Conference on Machine Learning, 2018

Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?
Proceedings of the 35th International Conference on Machine Learning, 2018

Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints.
Proceedings of the 35th International Conference on Machine Learning, 2018

Conditional Gradient Method for Stochastic Submodular Maximization: Closing the Gap.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

Submodularity on Hypergraphs: From Sets to Sequences.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

Comparison Based Learning from Weak Oracles.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

Online Continuous Submodular Maximization.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
Deletion-Robust Submodular Maximization at Scale.
CoRR, 2017

Submodular Variational Inference for Network Reconstruction.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Gradient Methods for Submodular Maximization.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Streaming Weak Submodularity: Interpreting Neural Networks on the Fly.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Interactive Submodular Bandit.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

A Submodular Approach to Create Individualized Parcellations of the Human Brain.
Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2017, 2017

Probabilistic Submodular Maximization in Sub-Linear Time.
Proceedings of the 34th International Conference on Machine Learning, 2017

Differentially Private Submodular Maximization: Data Summarization in Disguise.
Proceedings of the 34th International Conference on Machine Learning, 2017

Deletion-Robust Submodular Maximization: Data Summarization with "the Right to be Forgotten".
Proceedings of the 34th International Conference on Machine Learning, 2017

Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization.
Proceedings of the 30th Conference on Learning Theory, 2017

Near-Optimal Active Learning of Halfspaces via Query Synthesis in the Noisy Setting.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Distributed Submodular Maximization.
J. Mach. Learn. Res., 2016

Dimension Coupling: Optimal Active Learning of Halfspaces via Query Synthesis.
CoRR, 2016

Fast Distributed Submodular Cover: Public-Private Data Summarization.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Estimating the Size of a Large Network and its Communities from a Random Sample.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Fast Constrained Submodular Maximization: Personalized Data Summarization.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Learning network structures from firing patterns.
Proceedings of the 2016 IEEE International Conference on Acoustics, 2016

Seeing the Unseen Network: Inferring Hidden Social Ties from Respondent-Driven Sampling.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
From Small-World Networks to Comparison-Based Search.
IEEE Trans. Inf. Theory, 2015

Distributed Submodular Cover: Succinctly Summarizing Massive Data.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Asynchronous decoding of LDPC codes over BEC.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Non-Monotone Adaptive Submodular Maximization.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Normalization Phenomena in Asynchronous Networks.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Fast Mixing for Discrete Point Processes.
Proceedings of The 28th Conference on Learning Theory, 2015

Sequential Information Maximization: When is Greedy Near-optimal?
Proceedings of The 28th Conference on Learning Theory, 2015

Tradeoffs for Space, Time, Data and Risk in Unsupervised Learning.
Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, 2015

Lazier Than Lazy Greedy.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Submodular Surrogates for Value of Information.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Noise Facilitation in Associative Memories of Exponential Capacity.
Neural Comput., 2014

Convolutional Neural Associative Memories: Massive Capacity with Noise Tolerance.
CoRR, 2014

Streaming submodular maximization: massive data summarization on the fly.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Near-Optimally Teaching the Crowd to Classify.
Proceedings of the 31th International Conference on Machine Learning, 2014

Near Optimal Bayesian Active Learning for Decision Making.
Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, 2014

2013
Calibration Using Matrix Completion With Application to Ultrasound Tomography.
IEEE Trans. Signal Process., 2013

Robust Localization From Incomplete Local Information.
IEEE/ACM Trans. Netw., 2013

Constrained Binary Identification Problem.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Distributed Submodular Maximization: Identifying Representative Elements in Massive Data.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Noise-Enhanced Associative Memories.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Coupled neural associative memories.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Iterative Learning and Denoising in Convolutional Neural Associative Memories.
Proceedings of the 30th International Conference on Machine Learning, 2013

2012
Graph-Constrained Group Testing.
IEEE Trans. Inf. Theory, 2012

Low-Rank Matrix Approximation Using Point-Wise Operators.
IEEE Trans. Inf. Theory, 2012

Multi-Level Error-Resilient Neural Networks with Learning
CoRR, 2012

Sequential group testing with graph constraints.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Hot or not: Interactive content search using comparisons.
Proceedings of the 2012 Information Theory and Applications Workshop, 2012

Multi-level error-resilient neural networks.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Comparison-Based Learning with Rank Nets.
Proceedings of the 29th International Conference on Machine Learning, 2012

2011
Group Testing With Probabilistic Tests: Theory, Design and Application.
IEEE Trans. Inf. Theory, 2011

Adaptive Content Search Through Comparisons
CoRR, 2011

Compression with graphical constraints: An interactive browser.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Calibration in circular ultrasound tomography devices.
Proceedings of the IEEE International Conference on Acoustics, 2011

Content Search through Comparisons.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Calibration for Ultrasound Breast Tomography Using Matrix Completion
CoRR, 2010

Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm.
Proceedings of the SIGMETRICS 2010, 2010

From centralized to distributed sensor localization.
Proceedings of the 2010 ACM workshop on Wireless of the students, 2010

2009
An Estimation Theoretic Approach for Sparsity Pattern Recovery in the Noisy Setting
CoRR, 2009

Compressed Sensing with Probabilistic Measurements: A Group Testing Solution
CoRR, 2009

Support recovery in compressed sensing: An estimation theoretic approach.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2007
A new DOA estimation method using a circular microphone array.
Proceedings of the 15th European Signal Processing Conference, 2007

2006
A DOA estimation method for an arbitrary triangular microphone arrangement.
Proceedings of the 14th European Signal Processing Conference, 2006


  Loading...