vix.ing · top · new · best · stats · spec

Vijayaraghavan, Aravindan

  1. Beating the random assignment on constraint satisfaction problems of bounded degree
    2015/05/13 by Boaz Barak, Ankur Moitra, Barak, Boaz +17 · 4 citations
    Computer Science · Engineering · #Computational Complexity (cs.CC) #Constraint Satisfaction and Optimization #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Packing Problems #Scheduling and Optimization Algorithms
  2. Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability
    2013/04/30 by Aditya Bhaskara, Bhaskara, Aditya, Moses Charikar +3 · 6 citations
    Mathematics · Computer Science · Medicine · #Tensor decomposition and applications #Machine Learning and Algorithms #Hyperglycemia and glycemic control in critically ill and hospitalized patients
  3. Theoretical Analysis of Weak-to-Strong Generalization
    2024/05/25 by Hunter Lang, Lang, Hunter, David Sontag +3 · 8 citations
    Computer Science · #Computation and Language (cs.CL) #FOS: Computer and information sciences #Image and Signal Denoising Methods #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Neural Networks and Applications
  4. Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay
    2020/04/22 by Maiti, Biswaroop, Rajaraman, Rajmohan, Stalfa, David +2 · 3 citations
    #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
  5. Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
    2011/10/06 by Bhaskara, Aditya, Charikar, Moses, Guruswami, Venkatesan +2 · 2 citations
    #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  6. Smoothed Analysis of Tensor Decompositions
    2013/11/14 by Aditya Bhaskara, Moses Charikar, Bhaskara, Aditya +5 · 2 citations
    Computer Science · Mathematics · Physics and Astronomy · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Machine Learning and Algorithms #Model Reduction and Neural Networks #Tensor decomposition and applications
  7. Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond
    2022/12/07 by Johnston, Nathaniel, Lovitz, Benjamin, Vijayaraghavan, Aravindan · 3 citations
    #Algebraic Geometry (math.AG) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Machine Learning (cs.LG) #Quantum Physics (quant-ph)
  8. Efficient Algorithms for Learning Depth-2 Neural Networks with General ReLU Activations
    2021/07/21 by Awasthi, Pranjal, Tang, Alex, Vijayaraghavan, Aravindan · 2 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML)
  9. Approximating Matrix p-norms
    2010/01/15 by Aditya Bhaskara, Aravindan Vijayaraghavan, Bhaskara, Aditya +1 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
  10. Approximation Algorithms and Hardness of the k-Route Cut Problem
    2011/12/15 by Chuzhoy, Julia, Makarychev, Yury, Vijayaraghavan, Aravindan +1 · 1 citation
    #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  11. Approximation Algorithms for Semi-random Graph Partitioning Problems
    2012/05/10 by Konstantin Makarychev, Makarychev, Konstantin, Yury Makarychev +3 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  12. Clustering Semi-Random Mixtures of Gaussians
    2017/11/23 by Pranjal Awasthi, Aravindan Vijayaraghavan, Awasthi, Pranjal +1 · 1 citation
    Computer Science · #Bayesian Methods and Mixture Models #Advanced Clustering Algorithms Research #Data Management and Algorithms
  13. On Robustness to Adversarial Examples and Polynomial Optimization
    2019/11/12 by Awasthi, Pranjal, Dutta, Abhratanu, Vijayaraghavan, Aravindan · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML)
  14. Estimating Principal Components under Adversarial Perturbations
    2020/05/31 by Awasthi, Pranjal, Chen, Xue, Vijayaraghavan, Aravindan · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML)
  15. Adversarial robustness via robust low rank representations
    2020/07/13 by Awasthi, Pranjal, Jain, Himanshu, Rawat, Ankit Singh +1 · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML)
  16. Smoothed Analysis in Unsupervised Learning via Decoupling
    2018/11/29 by Bhaskara, Aditya, Chen, Aidao, Perreault, Aidan +1 · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML)
  17. Agnostic Learning of General ReLU Activation Using Gradient Descent
    2022/08/04 by Awasthi, Pranjal, Tang, Alex, Vijayaraghavan, Aravindan · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML)
  18. The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound
    2022/11/22 by Liam O’Carroll, O'Carroll, Liam, Vaidehi Srinivas +3 · 1 citation
    Computer Science · Engineering · Mathematics · #Advanced Optimization Algorithms Research #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning and Algorithms #Optimization and Control (math.OC) #Sparse and Compressive Sensing Techniques
  19. Volume Optimality in Conformal Prediction with Structured Prediction Sets
    2025/02/23 by Chao Gao, Liren Shan, Gao, Chao +5 · 4 citations
    Computer Science · #FOS: Computer and information sciences #Generative Adversarial Networks and Image Synthesis #Image and Signal Denoising Methods #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Neural Networks and Applications
  20. Agnostic Learning of Arbitrary ReLU Activation under Gaussian Marginals
    2024/11/21 by Guo, Anxin, Vijayaraghavan, Aravindan · 2 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML)
  21. New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries
    2024/05/02 by Aditya Bhaskara, Bhaskara, Aditya, Eric Evert +5 · 1 citation
    Mathematics · Physics and Astronomy · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Markov Chains and Monte Carlo Methods #Random Matrices and Applications #Theoretical and Computational Physics
  22. Efficient Certificates of Anti-Concentration Beyond Gaussians
    2024/05/23 by Ainesh Bakshi, Bakshi, Ainesh, Pravesh K. Kothari +7 · 1 citation
    Computer Science · Decision Sciences · #Advanced Statistical Process Monitoring #Data Structures and Algorithms (cs.DS) #Distributed Sensor Networks and Detection Algorithms #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML)
  23. Efficient Tensor Decomposition
    2020/07/30 by Aravindan Vijayaraghavan, Vijayaraghavan, Aravindan · 1 citation
    Mathematics · Engineering · #Tensor decomposition and applications #Sparse and Compressive Sensing Techniques #Power System Optimization and Stability