Matthew J. Streeter
Luis von Ahn
Matthew J. Streeter
Behind the Scenes of Duolingo.
3
2015
EDM
http://www.educationaldatamining.org/EDM2015/proceedings/abstract3.pdf
conf/edm/2015
db/conf/edm/edm2015.html#AhnS15
Matthew J. Streeter
Mixture Modeling of Individual Learning Curves.
45-52
2015
EDM
http://www.educationaldatamining.org/EDM2015/proceedings/full45-52.pdf
conf/edm/2015
db/conf/edm/edm2015.html#Streeter15
H. Brendan McMahan
Matthew J. Streeter
Delay-Tolerant Algorithms for Asynchronous Distributed Online Learning.
2915-2923
2014
NIPS
https://proceedings.neurips.cc/paper/2014/hash/5cce8dede893813f879b873962fb669f-Abstract.html
http://papers.nips.cc/paper/5242-delay-tolerant-algorithms-for-asynchronous-distributed-online-learning
conf/nips/2014
db/conf/nips/nips2014.html#McMahanS14
Daniel Golovin
Andreas Krause 0001
Matthew J. Streeter
Online Submodular Maximization under a Matroid Constraint with Application to Learning Assignments.
2014
abs/1407.1082
CoRR
http://arxiv.org/abs/1407.1082
db/journals/corr/corr1407.html#GolovinKS14
Matthew J. Streeter
H. Brendan McMahan
No-Regret Algorithms for Unconstrained Online Convex Optimization.
2411-2419
2012
NIPS
https://proceedings.neurips.cc/paper/2012/hash/38ca89564b2259401518960f7a06f94b-Abstract.html
http://papers.nips.cc/paper/4709-no-regret-algorithms-for-unconstrained-online-convex-optimization
conf/nips/2012
db/conf/nips/nips2012.html#StreeterM12
H. Brendan McMahan
Matthew J. Streeter
Open Problem: Better Bounds for Online Logistic Regression.
44.1-44.3
COLT
2012
conf/colt/2012
http://proceedings.mlr.press/v23/mcmahan12/mcmahan12.pdf
db/journals/jmlr/jmlrp23.html#McMahanS12
Matthew J. Streeter
Stephen F. Smith
New Techniques for Algorithm Portfolio Design
http://arxiv.org/abs/1206.3286
2012
CoRR
abs/1206.3286
db/journals/corr/corr1206.html#abs-1206-3286
Matthew J. Streeter
H. Brendan McMahan
No-Regret Algorithms for Unconstrained Online Convex Optimization
http://arxiv.org/abs/1211.2260
2012
CoRR
abs/1211.2260
db/journals/corr/corr1211.html#abs-1211-2260
Stephen F. Smith
Matthew J. Streeter
How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines
http://arxiv.org/abs/1110.0024
2011
CoRR
abs/1110.0024
db/journals/corr/corr1110.html#abs-1110-0024
H. Brendan McMahan
Matthew J. Streeter
Adaptive Bound Optimization for Online Convex Optimization.
244-256
2010
COLT
http://colt2010.haifa.il.ibm.com/papers/COLT2010proceedings.pdf#page=252
conf/colt/2010
db/conf/colt/colt2010.html#McMahanS10
Matthew J. Streeter
H. Brendan McMahan
Less Regret via Online Conditioning
http://arxiv.org/abs/1002.4862
2010
CoRR
abs/1002.4862
db/journals/corr/corr1002.html#abs-1002-4862
H. Brendan McMahan
Matthew J. Streeter
Adaptive Bound Optimization for Online Convex Optimization
http://arxiv.org/abs/1002.4908
2010
CoRR
abs/1002.4908
db/journals/corr/corr1002.html#abs-1002-4908
H. Brendan McMahan
Matthew J. Streeter
Tighter Bounds for Multi-Armed Bandits with Expert Advice.
2009
COLT
http://www.cs.mcgill.ca/~colt2009/papers/023.pdf#page=1
conf/colt/2009
db/conf/colt/colt2009.html#McMahanS09
Matthew J. Streeter
Daniel Golovin
Andreas Krause 0001
Online Learning of Assignments.
1794-1802
2009
NIPS
https://proceedings.neurips.cc/paper/2009/hash/e0c641195b27425bb056ac56f8953d24-Abstract.html
http://papers.nips.cc/paper/3719-online-learning-of-assignments
conf/nips/2009
db/conf/nips/nips2009.html#StreeterGK09
Daniel Golovin
Andreas Krause 0001
Matthew J. Streeter
Online Learning of Assignments that Maximize Submodular Functions
http://arxiv.org/abs/0908.0772
2009
CoRR
abs/0908.0772
db/journals/corr/corr0908.html#abs-0908-0772
John R. Koza
Matthew J. Streeter
Martin A. Keane
Routine high-return human-competitive automated problem-solving by means of genetic programming.
4434-4452
2008
178
Inf. Sci.
23
https://doi.org/10.1016/j.ins.2008.07.028
db/journals/isci/isci178.html#KozaSK08
Matthew J. Streeter
Daniel Golovin
An Online Algorithm for Maximizing Submodular Functions.
1577-1584
2008
NIPS
https://proceedings.neurips.cc/paper/2008/hash/5751ec3e9a4feab575962e78e006250d-Abstract.html
http://papers.nips.cc/paper/3569-an-online-algorithm-for-maximizing-submodular-functions
conf/nips/2008
db/conf/nips/nips2008.html#StreeterG08
Matthew J. Streeter
Stephen F. Smith
New Techniques for Algorithm Portfolio Design.
519-527
2008
UAI
https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=1970&proceeding_id=24
conf/uai/2008
db/conf/uai/uai2008.html#StreeterS08
Matthew J. Streeter
Daniel Golovin
Stephen F. Smith
Combining Multiple Heuristics Online.
1197-1203
2007
conf/aaai/2007
AAAI
db/conf/aaai/aaai2007.html#StreeterGS07
http://www.aaai.org/Library/AAAI/2007/aaai07-190.php
Matthew J. Streeter
Daniel Golovin
Stephen F. Smith
Restart Schedules for Ensembles of Problem Instances.
1204-1210
2007
conf/aaai/2007
AAAI
db/conf/aaai/aaai2007.html#StreeterGS07a
http://www.aaai.org/Library/AAAI/2007/aaai07-191.php
Matthew J. Streeter
Stephen F. Smith
Using Decision Procedures Efficiently for Optimization.
312-319
2007
ICAPS
conf/aips/2007
db/conf/aips/icaps2007.html#StreeterS07
http://www.aaai.org/Library/ICAPS/2007/icaps07-040.php
Matthew J. Streeter
Stephen F. Smith
How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines.
247-287
2006
26
J. Artif. Intell. Res.
https://doi.org/10.1613/jair.2013
db/journals/jair/jair26.html#StreeterS06
Matthew J. Streeter
Stephen F. Smith
An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem.
2006
conf/aaai/2006
AAAI
db/conf/aaai/aaai2006.html#StreeterS06
http://www.aaai.org/Library/AAAI/2006/aaai06-022.php
135-142
Matthew J. Streeter
Stephen F. Smith
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling.
324-333
2006
conf/aips/2006
ICAPS
db/conf/aips/icaps2006.html#StreeterS06
http://www.aaai.org/Library/ICAPS/2006/icaps06-033.php
Matthew J. Streeter
Stephen F. Smith
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem.
560-574
2006
conf/cp/2006
CP
https://doi.org/10.1007/11889205_40
db/conf/cp/cp2006.html#StreeterS06
John R. Koza
Martin A. Keane
Matthew J. Streeter
Sameer H. Al-Sakran
Lee W. Jones
Human-Competitive Evolvable Hardware Created by Means of Genetic Programming.
173-197
2006
Evolvable Hardware
https://doi.org/10.1007/0-387-31238-2_10
books/sp/06/HLY2006
db/books/collections/HLY2006.html#KozaKSAJ06
Matthew J. Streeter
Stephen F. Smith
Charecterizing the Distribution of Low-Makespan Schedules in the Job Shop Scheduling Problem.
61-70
2005
conf/aips/2005
ICAPS
db/conf/aips/icaps2005.html#StreeterS05
http://www.aaai.org/Library/ICAPS/2005/icaps05-007.php
John R. Koza
Martin A. Keane
Matthew J. Streeter
Thomas P. Adams
Lee W. Jones
Invention and creativity in automated design by means of genetic programming.
245-269
2004
18
Artif. Intell. Eng. Des. Anal. Manuf.
3
db/journals/aiedam/aiedam18.html#KozaKSAJ04
https://doi.org/10.1017/S089006040404017X
John R. Koza
Martin A. Keane
Matthew J. Streeter
Routine automated synthesis of five patented analog circuits using genetic programming.
318-324
2004
8
Soft Comput.
5
https://doi.org/10.1007/s00500-003-0288-9
db/journals/soco/soco8.html#KozaKS04
John R. Koza
Martin A. Keane
Matthew J. Streeter
Routine High-Return Human-Competitive Evolvable Hardware.
3-17
2004
conf/eh/2004
Evolvable Hardware
https://doi.org/10.1109/EH.2004.1310803
https://doi.ieeecomputersociety.org/10.1109/EH.2004.1310803
db/conf/eh/eh2004.html#KozaKS04
Matthew J. Streeter
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions.
186-197
https://doi.org/10.1007/978-3-540-24855-2_17
2004
conf/gecco/2004-2
GECCO (2)
db/conf/gecco/gecco2004-2.html#Streeter04
John R. Koza
Martin A. Keane
Matthew J. Streeter
What's AI Done for Me Lately? Genetic Programming's Human-Competitive Results.
25-31
2003
18
IEEE Intell. Syst.
3
https://doi.org/10.1109/MIS.2003.1200724
http://doi.ieeecomputersociety.org/10.1109/MIS.2003.1200724
db/journals/expert/expert18.html#KozaKS03
Matthew J. Streeter
Lee A. Becker
Automated Discovery of Numerical Approximation Formulae via Genetic Programming.
255-286
2003
4
Genet. Program. Evolvable Mach.
3
https://doi.org/10.1023/A:1025176407779
db/journals/gpem/gpem4.html#StreeterB03
John R. Koza
Martin A. Keane
Matthew J. Streeter
The Importance of Reuse and Development in Evolvable Hardware.
33-42
2003
conf/eh/2003
Evolvable Hardware
https://doi.org/10.1109/EH.2003.1217640
https://doi.ieeecomputersociety.org/10.1109/EH.2003.1217640
db/conf/eh/eh2003.html#KozaKS03
Matthew J. Streeter
The Root Causes of Code Growth in Genetic Programming.
443-454
2003
conf/eurogp/2003
EuroGP
https://doi.org/10.1007/3-540-36599-0_42
db/conf/eurogp/eurogp2003.html#Streeter03
Matthew J. Streeter
Two Broad Classes of Functions for Which a No Free Lunch Result Does Not Hold.
1418-1430
2003
conf/gecco/2003-2
GECCO
https://doi.org/10.1007/3-540-45110-2_15
db/conf/gecco/gecco2003-2.html#Streeter03
Martin A. Keane
John R. Koza
Matthew J. Streeter
Automatic Synthesis Using Genetic Programming of an Improved General-Purpose Controller for Industrially Representative Plants.
113-122
2002
conf/eh/2002
Evolvable Hardware
https://doi.org/10.1109/EH.2002.1029873
https://doi.ieeecomputersociety.org/10.1109/EH.2002.1029873
db/conf/eh/eh2002.html#KeaneKS02
Matthew J. Streeter
Martin A. Keane
John R. Koza
Routine Duplication of Post-2000 Patented Inventions by Means of Genetic Programming.
26-36
2002
conf/eurogp/2002
EuroGP
https://doi.org/10.1007/3-540-45984-7_3
db/conf/eurogp/eurogp2002.html#StreeterKK02
Matthew J. Streeter
Martin A. Keane
John R. Koza
Iterative Refinement Of Computational Circuits Using Genetic Programming.
877-884
2002
conf/gecco/2002
GECCO
db/conf/gecco/gecco2002.html#StreeterKK02
Thomas P. Adams
Luis von Ahn
Sameer H. Al-Sakran
Lee A. Becker
Daniel Golovin
Lee W. Jones
Martin A. Keane
John R. Koza
Andreas Krause 0001
H. Brendan McMahan
Stephen F. Smith