Aditya Bhaskara

Orcid: 0000-0001-5505-3140

According to our database1, Aditya Bhaskara authored at least 63 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Data Exchange Markets via Utility Balancing.
CoRR, 2024

2023
On Mergable Coresets for Polytope Distance.
CoRR, 2023

Understanding the Effect of the Long Tail on Neural Network Compression.
CoRR, 2023

Exploring Adversarial Attacks on Learning-based Localization.
Proceedings of the 2023 ACM Workshop on Wireless Security and Machine Learning, 2023

Learning-based Techniques for Transmitter Localization: A Case Study on Model Robustness.
Proceedings of the 20th Annual IEEE International Conference on Sensing, 2023

An NSF REU Site Based on Trust and Reproducibility of Intelligent Computation: Experience Report.
Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, 2023

Tight Bounds for Volumetric Spanners and Applications.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Online Learning and Bandits with Queried Hints.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Bandit Online Linear Optimization with Hints and Queries.
Proceedings of the International Conference on Machine Learning, 2023

Structure of Nonlinear Node Embeddings in Stochastic Block Models.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Competing against Adaptive Strategies in Online Learning via Hints.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Smoothed analysis for tensor methods in unsupervised learning.
Math. Program., 2022

Deep Learning-based Localization in Limited Data Regimes.
Proceedings of the WiseML@WiSec 2022: Proceedings of the 2022 ACM Workshop on Wireless Security and Machine Learning, 2022

2021
Logarithmic Regret from Sublinear Hints.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Additive Error Guarantees for Weighted Low Rank Approximation.
Proceedings of the 38th International Conference on Machine Learning, 2021

Fair Clustering via Equitable Group Representations.
Proceedings of the FAccT '21: 2021 ACM Conference on Fairness, 2021

Principal Component Regression with Semirandom Observations via Matrix Completion.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Power of Hints for Online Learning with Movement Costs.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Reliable Model Compression via Label-Preservation-Aware Loss Functions.
CoRR, 2020

A plug-n-play game theoretic framework for defending against radio window attacks.
Proceedings of the WiSec '20: 13th ACM Conference on Security and Privacy in Wireless and Mobile Networks, 2020

Correctness-preserving Compression of Datasets and Neural Network Models.
Proceedings of the 4th IEEE/ACM International Workshop on Software Correctness for HPC Applications, 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

Adaptive Probing Policies for Shortest Path Routing.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Online Linear Optimization with Many Hints.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Online Learning with Imperfect Hints.
Proceedings of the 37th International Conference on Machine Learning, 2020

Robust Algorithms for Online k-means Clustering.
Proceedings of the Algorithmic Learning Theory, 2020

2019
Approximating a planar convex set using a sparse grid.
Inf. Process. Lett., 2019

On Distributed Averaging for Stochastic k-PCA.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Greedy Sampling for Approximate Clustering in the Presence of Outliers.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Towards Wireless Environment Cognizance Through Incremental Learning.
Proceedings of the 16th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2019

Residual Based Sampling for Online Low Rank Approximation.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Smoothed Analysis in Unsupervised Learning via Decoupling.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Approximate Guarantees for Dictionary Learning.
Proceedings of the Conference on Learning Theory, 2019

2018
Privacy Enabled Crowdsourced Transmitter Localization Using Adjusted Measurements.
Proceedings of the 2018 IEEE Symposium on Privacy-Aware Computing, 2018

Privacy Enabled Noise Free Data Collection in Vehicular Networks.
Proceedings of the 15th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2018

Non-Negative Sparse Regression and Column Subset Selection with L1 Error.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Distributed Clustering via LSH Based Data Partitioning.
Proceedings of the 35th International Conference on Machine Learning, 2018

Sublinear Algorithms for MAXCUT and Correlation Clustering.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Low Rank Approximation in the Presence of Outliers.
Proceedings of the Approximation, 2018

2017
On Binary Embedding using Circulant Matrices.
J. Mach. Learn. Res., 2017

2016
Expanders via Local Edge Flips.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Linear Relaxations for Finding Diverse Elements in Metric Spaces.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Greedy Column Subset Selection: New Bounds and Distributed Algorithms.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2015
Centrality of trees for capacitated k-center.
Math. Program., 2015

Optimizing Display Advertising in Online Social Networks.
Proceedings of the 24th International Conference on World Wide Web, 2015

Sparse Solutions to Nonnegative Linear Systems and Applications.
Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, 2015

2014
More Algorithms for Provable Dictionary Learning.
CoRR, 2014

Smoothed analysis of tensor decompositions.
Proceedings of the Symposium on Theory of Computing, 2014

Distributed Balanced Clustering via Mapping Coresets.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Provable Bounds for Learning Some Deep Representations.
Proceedings of the 31th International Conference on Machine Learning, 2014

Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability.
Proceedings of The 27th Conference on Learning Theory, 2014

Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold?
Proceedings of The 27th Conference on Learning Theory, 2014

2013
Optimal Hitting Sets for Combinatorial Shapes.
Theory Comput., 2013

Centrality of Trees for Capacitated k-Center
CoRR, 2013

Minimum Makespan Scheduling with Low Rank Processing Times.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
Unconditional differentially private mechanisms for linear queries.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Polynomial integrality gaps for strong SDP relaxations of Densest <i>k</i>-subgraph.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

On Quadratic Programming with a Ratio Objective.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
CoRR, 2011

Approximating Matrix p-norms.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph
CoRR, 2010

Computing the Matrix p-norm
CoRR, 2010

Detecting high log-densities: an <i>O</i>(<i>n</i><sup>1/4</sup>) approximation for densest <i>k</i>-subgraph.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010


  Loading...