Page 65 - 2017 Brochure
P. 65
究員
呂及人 Chi-Jen Lu
Research Fellow
Ph.D., Computer Science, University of Massachusetts at Amherst
Tel: +886-2-2788-3799 ext. 1820 Fax: +886-2-2782-4814
Email: cjlu@iis.sinica.edu.tw
http://www.iis.sinica.edu.tw/pages/cjlu
• Associate Research Fellow, Institute of Information Science, Academia Sinica (2003-2008)
• Assistant Research Fellow, Institute of Information Science, Academia Sinica (1999-2003)
• Assistant Professor, Computer Science and Information Engineering, National Chi Nan University (1999)
• M.S., Computer Science and Information Engineering, National Taiwan University (1990)
• B.S., Computer Science and Information Engineering, National Taiwan University (1988)
Research Description
Many situations in daily life require us to make repeated
decisions before knowing the resulting outcomes. This common
scenario motivates our study of the online decision problem, in
which one must iteratively choose an action and then receive
a corresponding loss for a certain number of rounds. This is a
fundamental problem in the area of machine learning and has
found surprising applications in several other areas as well. In
addressing this problem, we have obtained several results. First,
we identified natural scenarios for which online algorithms with
better performance may be designed. Second, we transformed the
powerful boosting algorithm in machine learning from the traditional
batch setting to this online setting. Finally, we discovered new
applications of this problem in other areas, such as game theory
and complexity theory, which further demonstrate the importance of
this problem.
Publications 7. Chao-Kai Chiang, Chia-Jung Lee, and Chi-Jen Lu. Beating bandits in
gradually evolving worlds. In Proceedings of the 26th Conference on
1. Chen-Yu Wei, Yi-Te Hong, and Chi-Jen Lu. Tracking the Best Expert Learning Theory (COLT), 2013.
in Non-stationary Stochastic Environments. In Proceedings of the 30th
Annual Conference on Neural Information Processing Systems (NIPS), 8. Shang-Tse Chen, Hsuan-Tien Lin, and Chi-Jen Lu. An online boosting
2016. algorithm with theoretical justifications. In Proceedings of the 29th
International Conference on Machine Learning (ICML), 2012.
2. Chun-Liang Li, Hsuan-Tien Lin, and Chi-Jen Lu. Rivalry of Two
Families of Algorithms for Memory-Restricted Streaming PCA, 9. Chao-Kai Chiang, Tianbao Yang, Chia-Jung Lee, Mehrdad Mahdavi,
In Proceedings of the 19th International Conference on Artificial Chi-Jen Lu, Rong Jin and Shenghuo Zhu. Online optimization with
Intelligence and Statistics (AISTATS), 2016. gradual variations. In Proceedings of the 25th Conference on Learning
Theory (COLT), 2012.
3. Po-An Chen and Chi-Jen Lu. Generalized mirror descents in
congestion games. Artificial Intelligence, 241, pp. 217-243, 2016. 10. Chi-Jen Lu. Hitting set generators for sparse polynomials over any
finite fields. In Proceedings of the 27th Annual IEEE Conference on
4. Po-An Chen, Yi-Le Chen, and Chi-Jen Lu. Bounds on the Price of Computational Complexity (CCC), 2012.
Anarchy for a More General Class of Directed Graphs in Opinion
Formation Games, Operations Research Letters, 44(6), pp. 808-811,
2016.
5. Yi-Te Hong and Chi-Jen Lu. Online Learning in Markov Decision
Processes with Continuous Actions. In proceedings of the 26th
International Conference on Algorithmic Learning Theory (ALT), pp.
302-316, 2015.
6. Shang-Tse Chen, Hsuan-Tien Lin, and Chi-Jen Lu. Boosting
with online binary learners for the multiclass bandit problem. In
Proceedings of the 31st International Conference on Machine
Learning (ICML), 2014.
63
呂及人 Chi-Jen Lu
Research Fellow
Ph.D., Computer Science, University of Massachusetts at Amherst
Tel: +886-2-2788-3799 ext. 1820 Fax: +886-2-2782-4814
Email: cjlu@iis.sinica.edu.tw
http://www.iis.sinica.edu.tw/pages/cjlu
• Associate Research Fellow, Institute of Information Science, Academia Sinica (2003-2008)
• Assistant Research Fellow, Institute of Information Science, Academia Sinica (1999-2003)
• Assistant Professor, Computer Science and Information Engineering, National Chi Nan University (1999)
• M.S., Computer Science and Information Engineering, National Taiwan University (1990)
• B.S., Computer Science and Information Engineering, National Taiwan University (1988)
Research Description
Many situations in daily life require us to make repeated
decisions before knowing the resulting outcomes. This common
scenario motivates our study of the online decision problem, in
which one must iteratively choose an action and then receive
a corresponding loss for a certain number of rounds. This is a
fundamental problem in the area of machine learning and has
found surprising applications in several other areas as well. In
addressing this problem, we have obtained several results. First,
we identified natural scenarios for which online algorithms with
better performance may be designed. Second, we transformed the
powerful boosting algorithm in machine learning from the traditional
batch setting to this online setting. Finally, we discovered new
applications of this problem in other areas, such as game theory
and complexity theory, which further demonstrate the importance of
this problem.
Publications 7. Chao-Kai Chiang, Chia-Jung Lee, and Chi-Jen Lu. Beating bandits in
gradually evolving worlds. In Proceedings of the 26th Conference on
1. Chen-Yu Wei, Yi-Te Hong, and Chi-Jen Lu. Tracking the Best Expert Learning Theory (COLT), 2013.
in Non-stationary Stochastic Environments. In Proceedings of the 30th
Annual Conference on Neural Information Processing Systems (NIPS), 8. Shang-Tse Chen, Hsuan-Tien Lin, and Chi-Jen Lu. An online boosting
2016. algorithm with theoretical justifications. In Proceedings of the 29th
International Conference on Machine Learning (ICML), 2012.
2. Chun-Liang Li, Hsuan-Tien Lin, and Chi-Jen Lu. Rivalry of Two
Families of Algorithms for Memory-Restricted Streaming PCA, 9. Chao-Kai Chiang, Tianbao Yang, Chia-Jung Lee, Mehrdad Mahdavi,
In Proceedings of the 19th International Conference on Artificial Chi-Jen Lu, Rong Jin and Shenghuo Zhu. Online optimization with
Intelligence and Statistics (AISTATS), 2016. gradual variations. In Proceedings of the 25th Conference on Learning
Theory (COLT), 2012.
3. Po-An Chen and Chi-Jen Lu. Generalized mirror descents in
congestion games. Artificial Intelligence, 241, pp. 217-243, 2016. 10. Chi-Jen Lu. Hitting set generators for sparse polynomials over any
finite fields. In Proceedings of the 27th Annual IEEE Conference on
4. Po-An Chen, Yi-Le Chen, and Chi-Jen Lu. Bounds on the Price of Computational Complexity (CCC), 2012.
Anarchy for a More General Class of Directed Graphs in Opinion
Formation Games, Operations Research Letters, 44(6), pp. 808-811,
2016.
5. Yi-Te Hong and Chi-Jen Lu. Online Learning in Markov Decision
Processes with Continuous Actions. In proceedings of the 26th
International Conference on Algorithmic Learning Theory (ALT), pp.
302-316, 2015.
6. Shang-Tse Chen, Hsuan-Tien Lin, and Chi-Jen Lu. Boosting
with online binary learners for the multiclass bandit problem. In
Proceedings of the 31st International Conference on Machine
Learning (ICML), 2014.
63
