运筹OR帷幄算法知识星球每天会发布全球学术界|业界算法相关职位信息, 今天为大家推荐可能是全球工资最高的博士后职位--IBM Goldstine Fellowship，不低于15w美元/年。
IBM Goldstine Fellowship是运筹学、数学优化、整数规划、计算机科学等领域的顶级博士后职位。统计往期获奖者从事的领域可以得出，运筹学、整数规划、算法、优化、机器学习等是得奖最多的几大领域。
The Mathematical Sciences department of the IBM Thomas J. Watson
Research Center invites applications for its 2020–2021 Memorial Postdoctoral Fellowship for research in mathematical and computer sciences. The fellowship provides scientists
of outstanding ability an opportunity to advance their scholarship as
resident department members at the Research Center. The Research
Center is located in Westchester County, less than an hour north of
New York City.
The department provides an atmosphere in which basic research is
combined with work on practical applications. Our permanent members,
academic visitors, and post-doctoral fellows pursue research in pure
and applied mathematics and in theoretical and exploratory computer
science. Areas of research include: algorithms, artificial
intelligence and machine learning, numerical analysis and scientific
computing, dynamical systems, inverse problems, optimization,
operations research, applied probability, and statistics. Close
interaction with permanent department members is expected and
encouraged, but fellows are free to pursue their own research interests.
Up to two fellowships will be awarded. Candidates must have received a
Ph.D. degree after September 2015 or should expect to receive one
before the fellowship commences in the second half of 2020 (usually in
September). The fellowship has a period of one year, and may be
extended for another year by mutual agreement. The stipend is expected
to be at least $150,000.
For full details and to apply, please visit:
The deadline for application is January 20, 2020.
An application should be submitted by January 20, 2020 via academicjobsonline.org (job id: #15531). It should consist of:
- Full CV.
- Abstract of your Ph.D. dissertation.
- A 2–3 page research statement describing your current and future research.
- 3 or more letters of recommendation, including one from the thesis advisor.
- Optionally, up to three recent papers.
A cover letter is not required. We strongly prefer all documents in PDF format.
Questions can be addressed to email@example.com.
IBM is committed to workplace diversity, and is proud to be an equal-opportunity employer.
- 2019 Clément Canonne (Theory of Algorithms, Ph.D. Columbia University)
- 2019 Zhengyuan Zhou (Operations Research & Optimization, Ph.D. Stanford University)
- 2018 Vasileios Kalantzis (Numerical Analysis & Scientific Computing, IBM Research)
- 2018 Shashanka Ubaru (Data Mining & Machine Learning, Ph.D. University of Minnesota)
- 2017 Hamsa Bastani (Operations Research & Optimization, University of Pennsylvania)
- 2017 Anastasios Kyrillidis (Operations Research & Optimization, Rice University)
- 2016 Karthikeyan Shanmugam (Machine Learning, IBM Research)
- 2016 Shay Solomon (Theory of Algorithms, Tel Aviv University)
- 2015 Robert Hildebrand (Operations Research & Optimization, Virginia Tech)
- 2015 Ramis Movassagh (Numerical Analysis & Scientific Computing, IBM Research)
- 2014 Michael Kapralov (Theory of Algorithms, EPFL)
- 2014 Liu Yang (Machine Learning, Ph.D. CMU)
- 2013 Alberto Del Pia (Optimization, UW-Madison)
- 2013 Stephen Becker (Data Mining & Machine Learning, University of Colorado, Boulder)
- 2012 Amir Ali Ahmadi (Optimization, Princeton University)
- 2011 Peter van de Ven (Probability & Stochastics, CWI, Netherlands)
- 2010 Dan Iancu (Operations Research, Stanford University)
- 2010 Neil Dobbs (Dynamical Systems, Dept. of Mathematics & Statistics, University College Dublin)
- 2009 Juan Pablo Vielma (Integer programming, MIT)
- 2008 Alexandru Niculescu-Mizil (Machine Learning, NEC Laboratories America)
- 2008 Ricardo Fukasawa (Integer Programming, University of Waterloo)
- 2007 Ton Dieker (Stochastic Processes, Columbia University)
- 2006 Alexandre Belloni (Optimization, Duke University)
- 2005 Retsef Levi (Operations Research, MIT)
- 2004 Andrea Lodi (Integer Programming, Polytechnique Montréal)
- 2003 Petar Momcilovic (Stochastic Processes, Texas A&M University)
- 2002 John Langford (Machine Learning, Microsoft Research)
- 2002 Sanjeeb Dash (Integer Programming, IBM Research)
- 2001 Philippe Baptiste (Scheduling & Constraint Programming, Chief of Staff to Minister of Higher Education, Research and Innovation, France)
- 2000 Moshe Lewenstein (Theory of Computation, Bar Ilan University)
- 1999 Xin Guo (Finance & Stochastic systems, UC Berkeley)
A partial list of awardees of the Fellowship before it was named “Goldstine”:
- 1998 Fabian Chudak (Combinatorial Optimization, D-Wave Systems Inc.)
- 1996 Chai Wah Wu (Dynamical Systems, IBM Research)
- 1994 Patrick A. Worfolk (Dynamical Systems)
- 1989 Jonathan Ashley (Infineon Technologies)
- 1988 Alice Silverberg (Cryptography, UC Irvine)
- 1987 Baruch Schieber (Scheduling and Algorithms, New Jersey Institute of Technology)
- 1981 Carl Lee (Discrete Geometry, Univ. of Kentucky)
- 1977 Don Coppersmith (Cryptography, IDA-CCR)
参考链接：2020-2021 Goldstine Fellowship www.research.ibm.com