• Source: Scopus
  • Calculated based on no. of publications stored in Pure and citations from Scopus
1990 …2020

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2019

    A theoretical analysis of contrastive unsupervised representation learning

    Arora, S., Khandeparkar, H., Khodak, M., Plevrakis, O. & Saunshi, N., 2019, 36th International Conference on Machine Learning, ICML 2019. International Machine Learning Society (IMLS), p. 9904-9923 20 p. (36th International Conference on Machine Learning, ICML 2019; vol. 2019-June).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Scopus citations
  • Fine-grained analysis of optimization and generalization for overparameterized two-layer neural networks

    Arora, S., Du, S. S., Hu, W., Li, Z. & Wang, R., Jan 1 2019, 36th International Conference on Machine Learning, ICML 2019. International Machine Learning Society (IMLS), p. 477-502 26 p. (36th International Conference on Machine Learning, ICML 2019; vol. 2019-June).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations
  • 2018

    A la carte embedding: Cheap but effective induction of semantic feature vectors

    Khodak, M., Saunshi, N., Liang, Y., Ma, T., Stewart, B. M. & Arora, S., 2018, ACL 2018 - 56th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers). Association for Computational Linguistics (ACL), p. 12-22 11 p. (ACL 2018 - 56th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers); vol. 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    20 Scopus citations
  • Mathematics of machine learning: An introduction

    Arora, S., 2018, Invited Lectures. Sirakov, B., de Souza, P. N. & Viana, M. (eds.). World Scientific Publishing Co. Pte Ltd, p. 377-390 14 p. (Proceedings of the International Congress of Mathematicians, ICM 2018; vol. 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations
  • On the optimization of deep networks: Implicit acceleration by overparameterization

    Arora, S., Cohen, N. & Hazan, E., Jan 1 2018, 35th International Conference on Machine Learning, ICML 2018. Krause, A. & Dy, J. (eds.). International Machine Learning Society (IMLS), p. 372-389 18 p. (35th International Conference on Machine Learning, ICML 2018; vol. 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    15 Scopus citations
  • Stronger generalization bounds for deep nets via a compression approach

    Arora, S., Ge, R., Neyshabur, B. & Zhang, Y., 2018, 35th International Conference on Machine Learning, ICML 2018. Krause, A. & Dy, J. (eds.). International Machine Learning Society (IMLS), p. 390-418 29 p. (35th International Conference on Machine Learning, ICML 2018; vol. 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    27 Scopus citations
  • 2017

    Generalization and equilibrium in generative adversarial nets (GANs)

    Arora, S., Ge, R., Liang, Y., Ma, T. & Zhang, Y., 2017, 34th International Conference on Machine Learning, ICML 2017. International Machine Learning Society (IMLS), p. 322-349 28 p. (34th International Conference on Machine Learning, ICML 2017; vol. 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    68 Scopus citations
  • Provable learning of noisy-or networks

    Arora, S., Ge, R., Ma, T. & Risteski, A., Jun 19 2017, STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. McKenzie, P., King, V. & Hatami, H. (eds.). Association for Computing Machinery, p. 1057-1066 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F128415).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations
  • 2016

    Provable algorithms for inference in topic models

    Arora, S., Ge, R., Koehler, F., Ma, T. & Moitra, A., Jan 1 2016, 33rd International Conference on Machine Learning, ICML 2016. Weinberger, K. Q. & Balcan, M. F. (eds.). International Machine Learning Society (IMLS), p. 4176-4184 9 p. (33rd International Conference on Machine Learning, ICML 2016; vol. 6).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations
  • 2014

    Provable bounds for learning some deep representations

    Arora, S., Bhaskara, A., Ge, R. & Ma, T., Jan 1 2014, 31st International Conference on Machine Learning, ICML 2014. International Machine Learning Society (IMLS), p. 883-891 9 p. (31st International Conference on Machine Learning, ICML 2014; vol. 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    60 Scopus citations
  • The work of Subhash Khot

    Arora, S., Jan 1 2014, Plenary Lectures and Ceremonies. Jang, S. Y., Kim, Y. R., Lee, D-W. & Yie, I. (eds.). KYUNG MOON SA Co. Ltd., p. 81-89 9 p. (Proceeding of the International Congress of Mathematicans, ICM 2014; vol. 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2013

    Towards a better approximation for SPARSEST CUT?

    Arora, S., Ge, R. & Sinop, A. K., Dec 1 2013, Proceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013. p. 270-279 10 p. 6686163. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations
  • 2012

    Computing a nonnegative matrix factorization - Provably

    Arora, S., Ge, R., Kannan, R. & Moitra, A., Jun 26 2012, STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. p. 145-161 17 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    176 Scopus citations
  • Finding overlapping communities in social networks: Toward a rigorous approach

    Arora, S., Ge, R., Sachdeva, S. & Schoenebeck, G., Jul 10 2012, EC '12 - Proceedings of the 13th ACM Conference on Electronic Commerce. p. 37-54 18 p. (Proceedings of the ACM Conference on Electronic Commerce).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    30 Scopus citations
  • Provable ICA with unknown Gaussian noise, with implications for Gaussian mixtures and autoencoders

    Arora, S., Ge, R., Moitra, A. & Sachdeva, S., Dec 1 2012, Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012, NIPS 2012. p. 2375-2383 9 p. (Advances in Neural Information Processing Systems; vol. 3).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    30 Scopus citations
  • Testing permanent oracles - Revisited

    Arora, S., Bhattacharyya, A., Manokaran, R. & Sachdeva, S., Aug 28 2012, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Proceedings. p. 362-373 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7408 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations
  • 2011

    New algorithms for learning in presence of errors

    Arora, S. & Ge, R., Jul 11 2011, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings. PART 1 ed. p. 403-415 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6755 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    95 Scopus citations
  • New tools for graph coloring

    Arora, S. & Ge, R., Sep 8 2011, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 14th International Workshop, APPROX 2011 and 15th International Workshop, RANDOM 2011, Proceedings. p. 1-12 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6845 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    14 Scopus citations
  • Semidefinite programming and approximation algorithms: A survey

    Arora, S., Dec 26 2011, Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings. p. 6-9 4 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7074 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2010

    Subexponential algorithms for unique games and related problems

    Arora, S., Barak, B. & Steurer, D., Dec 1 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. p. 563-572 10 p. 5671307. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    101 Scopus citations
  • 2009

    Message-passing algorithms and improved LP decoding

    Arora, S., Daskalakis, C. & Steurer, D., Nov 9 2009, STOC'09 - Proceedings of the 2009 ACM International Symposium on Theory of Computing. p. 3-12 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    32 Scopus citations
  • Towards a study of low-complexity graphs

    Arora, S., Steurer, D. & Wigderson, A., Nov 12 2009, Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings. PART 1 ed. p. 119-131 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5555 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    7 Scopus citations
  • 2008

    Unique games on expanding constraint graphs are easy

    Arora, S., Steurer, D., Knot, S. A., Tulsiani, M., Kolla, A. & Vishnoi, N. K., Dec 8 2008, STOC'08: Proceedings of the 2008 ACM Symposium on Theory of Computing. p. 21-28 8 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    55 Scopus citations
  • 2007

    A combinatorial, primal-dual approach to semidefinite programs

    Arora, S. & Kale, S., Oct 30 2007, STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing. p. 227-236 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    103 Scopus citations
  • 2006

    A fast random sampling algorithm for sparsifying matrices

    Arora, S., Hazan, E. & Kale, S., Jan 1 2006, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 a. Springer Verlag, p. 272-279 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4110 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    47 Scopus citations
  • New approximation guarantee for chromatic number

    Arora, S., Chlamtac, E. & Charikar, M., Sep 5 2006, STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. p. 215-224 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    48 Scopus citations
  • 2005

    Fast algorithms for approximate semidefinite programming using the multiplicative weights update method

    Arora, S., Hazan, E. E. & Kale, S., Dec 1 2005, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005. p. 339-348 10 p. 1530726. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2005).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    65 Scopus citations
  • On non-approximability for quadratic programs

    Arora, S., Berger, E., Hazan, E., Kindler, G. & Safra, M., 2005, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005. p. 206-215 10 p. 1530715. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2005).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    45 Scopus citations
  • 2003

    A note on the representational incompatibility of function approximation and factored dynamics

    Allender, E., Arora, S., Kearns, M., Moore, C. & Russell, A., Jan 1 2003, Advances in Neural Information Processing Systems 15 - Proceedings of the 2002 Conference, NIPS 2002. Neural information processing systems foundation, (Advances in Neural Information Processing Systems).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations
  • 2002

    A randomized online algorithm for bandwidth utilization

    Arora, S. & Brinkmann, B., Jan 1 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 535-539 5 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    13 Scopus citations
  • 2001

    Approximation schemes for geometric NP-hard problems: A survey

    Arora, S., Jan 1 2001, FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science - 21st Conference, Proceedings. Hariharan, R., Vinay, V. & Mukund, M. (eds.). Springer Verlag, p. 16-17 2 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2245).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2000

    2+ε approximation algorithm for the k-MST problem

    Arora, S. & Karakostas, G., Jan 1 2000, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, p. 754-759 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    55 Scopus citations
  • Approximation algorithms that take advice

    Arora, S., 2000, Approximation Algorithms for Combinatorial Optimization - 3rd International Workshop, APPROX 2000, Proceedings. Jansen, K. & Khuller, S. (eds.). Springer Verlag, 1 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1913).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 1998

    Polynomial-time approximation scheme for weighted planar graph TSP

    Arora, S., Grigni, M., Karger, D., Klein, P. & Woloszyn, A., Dec 1 1998, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Anon (ed.). SIAM, p. 33-41 9 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    84 Scopus citations
  • 1997

    Nearly linear time approximation schemes for Euclidean TSP and other geometric problems

    Arora, S., Jan 1 1997, Randomization and Approximation Techniques in Computer Science - International Workshop, RANDOM 1997, Proceedings. Rolim, J. (ed.). Springer Verlag, (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1269).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 1994

    Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)

    Arora, S., Rabani, Y. & Vazirani, U., May 23 1994, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994. Association for Computing Machinery, p. 459-467 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129502).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    17 Scopus citations
  • 1993

    Hardness of approximate optima in lattices, codes, and systems in linear equations

    Arora, S., Babai, L., Stern, J. & Sweedyk, Z., Dec 1 1993, Annual Symposium on Foundatons of Computer Science (Proceedings). Anon (ed.). Publ by IEEE, p. 724-733 10 p. (Annual Symposium on Foundatons of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    81 Scopus citations
  • 1992

    Probabilistic checking of proofs; A new characterization of NP

    Arora, S. & Safra, S., Jan 1 1992, Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, p. 2-13 12 p. 267824. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1992-October).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    134 Scopus citations
  • Proof verification and hardness of approximation problems

    Arora, S., Lund, C., Motwani, R., Sudan, M. & Szegedy, M., Jan 1 1992, Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, p. 14-23 10 p. 267823. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1992-October).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    424 Scopus citations
  • 1990

    On-line algorithms for path selection in a nonblocking network

    Arora, S., Leighton, T. & Maggs, B., 1990, Proc 22nd Annu ACM Symp Theory Comput. Publ by ACM, p. 149-158 10 p. (Proc 22nd Annu ACM Symp Theory Comput).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    42 Scopus citations