Yin Tat Lee

Citeret af

	Alle	Siden 2020
Henvisninger	15546	13707
h-index	55	52
i10-indeks	108	106

7000

3500

1750

5250

20142015201620172018201920202021202220232024202567 118 203 268 438 593 1003 1094 1340 3321 6260 632

Offentlig adgang

Se alle

62 artikler

2 artikler

tilgængelige

ikke tilgængelige

Baseret på krav i forbindelse med finansiering

Medforfattere

Sebastien BubeckOpenAIVerificeret mail på openai.com
Aaron SidfordStanford UniversityVerificeret mail på stanford.edu
Ronen EldanWeizmann InstituteVerificeret mail på weizmann.ac.il
Santosh S. VempalaGeorgia TechVerificeret mail på gatech.edu
Zhao SongSimons Institute for the Theory of Computing, UC BerkeleyVerificeret mail på ias.edu
Richard PengCarnegie Mellon UniversityVerificeret mail på cs.cmu.edu
Kevin TianAssistant Professor, University of Texas at AustinVerificeret mail på cs.utexas.edu
Francis BachInria - Ecole Normale SupérieureVerificeret mail på inria.fr
Jan van den BrandGeorgia TechVerificeret mail på gatech.edu
Laurent MassoulieInria, MSR-Inria Joint CentreVerificeret mail på inria.fr
Kevin ScamanResearch scientist, INRIAVerificeret mail på inria.fr
Michael B. CohenGraduate Student in Computer Science, MITVerificeret mail på mit.edu
Cameron MuscoAssistant Professor, University of Massachusetts AmherstVerificeret mail på cs.umass.edu
Christopher MuscoAssistant Professor, New York UniversityVerificeret mail på nyu.edu
Lorenzo OrecchiaUniversity of Chicago, Computer ScienceVerificeret mail på bu.edu
Tsz Chiu KwokUniversity of WaterlooVerificeret mail på uwaterloo.ca
Lap Chi LauUniversity of WaterlooVerificeret mail på cs.uwaterloo.ca
Thatchaphol SaranurakUniversity of MichiganVerificeret mail på umich.edu
He SunReader in Algorithms & Complexity, University of EdinburghVerificeret mail på ed.ac.uk
Michael KapralovAssociate Professor, EPFLVerificeret mail på epfl.ch

Følg

Yin Tat Lee

Paul G. Allen School of Computer Science & Engineering, University of Washington

Verificeret mail på uw.edu - Startside

convex optimization convex geometry spectral graph theory online algorithms


Titel Sortér efter henvisninger Sortér efter årstal Sortér efter titel	Citeret af Citeret af	År
Sparks of artificial general intelligence: Early experiments with gpt-4 S Bubeck, V Chandrasekaran, R Eldan, J Gehrke, E Horvitz, E Kamar, ... arXiv preprint arXiv:2303.12712, 2023	3568	2023
Phi-3 technical report: A highly capable language model locally on your phone M Abdin, J Aneja, H Awadalla, A Awadallah, AA Awan, N Bach, A Bahree, ... arXiv preprint arXiv:2404.14219, 2024	770	2024
Textbooks are all you need S Gunasekar, Y Zhang, J Aneja, CCT Mendes, A Del Giorno, S Gopi, ... arXiv preprint arXiv:2306.11644, 2023	548	2023
Solving linear programs in the current matrix multiplication time MB Cohen, YT Lee, Z Song Journal of the ACM (JACM) 68 (1), 1-39, 2021	462	2021
Path finding methods for linear programming: Solving linear programs in o (vrank) iterations and faster algorithms for maximum flow YT Lee, A Sidford 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 424-433, 2014	455*	2014
Sparks of artificial general intelligence: Early experiments with GPT-4. arXiv S Bubeck, V Chandrasekaran, R Eldan, J Gehrke, E Horvitz, E Kamar, ... arXiv preprint arXiv:2303.12712, 2023	418	2023
Textbooks are all you need ii: phi-1.5 technical report Y Li, S Bubeck, R Eldan, A Del Giorno, S Gunasekar, YT Lee arXiv preprint arXiv:2309.05463, 2023	405	2023
Optimal algorithms for smooth and strongly convex distributed optimization in networks K Scaman, F Bach, S Bubeck, YT Lee, L Massoulié international conference on machine learning, 3027-3036, 2017	380	2017
A faster cutting plane method and its implications for combinatorial and convex optimization YT Lee, A Sidford, SC Wong 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1049-1065, 2015	371	2015
Differentially private fine-tuning of language models D Yu, S Naik, A Backurs, S Gopi, HA Inan, G Kamath, J Kulkarni, YT Lee, ... arXiv preprint arXiv:2110.06500, 2021	353	2021
An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations JA Kelner, YT Lee, L Orecchia, A Sidford Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014	341	2014
Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems YT Lee, A Sidford 2013 ieee 54th annual symposium on foundations of computer science, 147-156, 2013	288	2013
Can generalist foundation models outcompete special-purpose tuning? case study in medicine H Nori, YT Lee, S Zhang, D Carignan, R Edgar, N Fusi, N King, J Larson, ... arXiv preprint arXiv:2311.16452, 2023	281	2023
Automatic prompt optimization with" gradient descent" and beam search R Pryzant, D Iter, J Li, YT Lee, C Zhu, M Zeng arXiv preprint arXiv:2305.03495, 2023	269	2023
Uniform sampling for matrix approximation MB Cohen, YT Lee, C Musco, C Musco, R Peng, A Sidford Proceedings of the 2015 conference on innovations in theoretical computer …, 2015	261	2015
Adversarial examples from computational constraints S Bubeck, YT Lee, E Price, I Razenshteyn International Conference on Machine Learning, 831-840, 2019	256	2019
Geometric median in nearly linear time MB Cohen, YT Lee, G Miller, J Pachocki, A Sidford Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016	206	2016
A geometric alternative to Nesterov's accelerated gradient descent S Bubeck, YT Lee, M Singh arXiv preprint arXiv:1506.08187, 2015	198	2015
Optimal algorithms for non-smooth distributed optimization in networks K Scaman, F Bach, S Bubeck, L Massoulié, YT Lee Advances in Neural Information Processing Systems 31, 2018	193	2018
Kernel-based methods for bandit convex optimization S Bubeck, R Eldan, YT Lee Journal of the ACM (JACM) 68 (4), 1-35, 2021	190	2021

Systemet kan ikke foretage handlingen nu. Prøv igen senere.

Artikler 1–20

Henvisninger pr. år

Dublerede henvisninger

Flettede henvisninger

Tilføj medforfattereMedforfattere

Følg

Citeret af

Medforfattere