Difference between revisions of "Michèle Sebag"

From Chessprogramming wiki
Jump to: navigation, search
Line 18: Line 18:
 
* [https://dblp.uni-trier.de/pers/hd/r/Rouveirol:C=eacute=line Céline Rouveirol], [[Michèle Sebag]] (eds.) ('''2001'''). ''[https://link.springer.com/book/10.1007%2F3-540-44797-0 Inductive Logic Programming - 11th International Conference, ILP 2001 Strasbourg, France, September 9–11, 2001 Proceedings]''. [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 2157, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
 
* [https://dblp.uni-trier.de/pers/hd/r/Rouveirol:C=eacute=line Céline Rouveirol], [[Michèle Sebag]] (eds.) ('''2001'''). ''[https://link.springer.com/book/10.1007%2F3-540-44797-0 Inductive Logic Programming - 11th International Conference, ILP 2001 Strasbourg, France, September 9–11, 2001 Proceedings]''. [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 2157, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
 
: [https://dblp.uni-trier.de/pers/hd/m/Maloberti:J=eacute=r=ocirc=me Jérôme Maloberti], [[Michèle Sebag]] ('''2001'''). ''[https://link.springer.com/chapter/10.1007/3-540-44797-0_14 θ-Subsumption in a Constraint Satisfaction Perspective]''. ILP 2001
 
: [https://dblp.uni-trier.de/pers/hd/m/Maloberti:J=eacute=r=ocirc=me Jérôme Maloberti], [[Michèle Sebag]] ('''2001'''). ''[https://link.springer.com/chapter/10.1007/3-540-44797-0_14 θ-Subsumption in a Constraint Satisfaction Perspective]''. ILP 2001
 +
==2005 ...==
 
* [[Sylvain Gelly]], [[Nicolas Bredèche]], [[Michèle Sebag]] ('''2005'''). ''From Factorial and Hierarchical HMM to Bayesian Network : A Representation Change Algorithm''. Proceedings of the Symposium on Abstraction, Reformulation and Approximation 2005, p107-120 ([http://www.informatik.uni-trier.de/~ley/db/conf/sara/sara2005.html#GellyBS05 SARA 2005]).  [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 3607
 
* [[Sylvain Gelly]], [[Nicolas Bredèche]], [[Michèle Sebag]] ('''2005'''). ''From Factorial and Hierarchical HMM to Bayesian Network : A Representation Change Algorithm''. Proceedings of the Symposium on Abstraction, Reformulation and Approximation 2005, p107-120 ([http://www.informatik.uni-trier.de/~ley/db/conf/sara/sara2005.html#GellyBS05 SARA 2005]).  [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 3607
 
* [[Marc Schoenauer]], [[Michèle Sebag]] ('''2006'''). ''Using Domain Knowledge in Evolutionary System Identification''. [https://arxiv.org/abs/cs/0602021 arXiv:cs/0602021]
 
* [[Marc Schoenauer]], [[Michèle Sebag]] ('''2006'''). ''Using Domain Knowledge in Evolutionary System Identification''. [https://arxiv.org/abs/cs/0602021 arXiv:cs/0602021]
 
==2010 ...==
 
==2010 ...==
 
* [[Romaric Gaudel]], [[Michèle Sebag]] ('''2010'''). ''Feature Selection as a one-player game''. [http://www.icml2010.org/ ICML 2010], [http://www.icml2010.org/papers/247.pdf pdf]
 
* [[Romaric Gaudel]], [[Michèle Sebag]] ('''2010'''). ''Feature Selection as a one-player game''. [http://www.icml2010.org/ ICML 2010], [http://www.icml2010.org/papers/247.pdf pdf]
 +
* [[Ilya Loshchilov]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2010'''). ''A mono surrogate for multiobjective optimization''. [https://dblp.org/db/conf/gecco/gecco2010.html GECCO 2010], [https://hal.inria.fr/inria-00483948/document pdf]
 +
* [[Ilya Loshchilov]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2011'''). ''Adaptive coordinate descent.'' [https://dblp.org/db/conf/gecco/gecco2011.html GECCO 2011], [http://www.loshchilov.com/publications/GECCO2011_AdaptiveCoordinateDescent.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Adaptive_coordinate_descent Adaptive coordinate descent from Wikipedia]</ref>
 
* [[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]
 
* [[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]
 
* [[Ilya Loshchilov]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2012'''). ''Self-Adaptive Surrogate-Assisted Covariance Matrix Adaptation Evolution Strategy''. [https://arxiv.org/abs/1204.2356 arXiv:1204.2356] <ref>[https://en.wikipedia.org/wiki/CMA-ES CMA-ES from Wikipedia]</ref>
 
* [[Ilya Loshchilov]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2012'''). ''Self-Adaptive Surrogate-Assisted Covariance Matrix Adaptation Evolution Strategy''. [https://arxiv.org/abs/1204.2356 arXiv:1204.2356] <ref>[https://en.wikipedia.org/wiki/CMA-ES CMA-ES from Wikipedia]</ref>
Line 27: Line 30:
 
* [[Thomas Philip Runarsson]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2012'''). ''Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling''. [https://arxiv.org/abs/1210.0374 arXiv:1210.0374]
 
* [[Thomas Philip Runarsson]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2012'''). ''Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling''. [https://arxiv.org/abs/1210.0374 arXiv:1210.0374]
 
* [[Ilya Loshchilov]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2013'''). ''KL-based Control of the Learning Schedule for Surrogate Black-Box Optimization''. [https://arxiv.org/abs/1308.2655 arXiv:1308.2655]
 
* [[Ilya Loshchilov]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2013'''). ''KL-based Control of the Learning Schedule for Surrogate Black-Box Optimization''. [https://arxiv.org/abs/1308.2655 arXiv:1308.2655]
 +
==2015 ...==
 
* [[Olivier Bousquet]], [[Sylvain Gelly]], [[Karol Kurach]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Damien Vincent]] ('''2017'''). ''Toward Optimal Run Racing: Application to Deep Learning Calibration''. [https://arxiv.org/abs/1706.03199 arXiv:1706.03199]
 
* [[Olivier Bousquet]], [[Sylvain Gelly]], [[Karol Kurach]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Damien Vincent]] ('''2017'''). ''Toward Optimal Run Racing: Application to Deep Learning Calibration''. [https://arxiv.org/abs/1706.03199 arXiv:1706.03199]
 
* [[Alice Schoenauer-Sebag]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2017'''). ''Stochastic Gradient Descent: Going As Fast As Possible But Not Faster''. [https://arxiv.org/abs/1709.01427 arXiv:1709.01427]
 
* [[Alice Schoenauer-Sebag]], [[Marc Schoenauer]], [[Michèle Sebag]] ('''2017'''). ''Stochastic Gradient Descent: Going As Fast As Possible But Not Faster''. [https://arxiv.org/abs/1709.01427 arXiv:1709.01427]

Revision as of 09:16, 13 September 2019

Home * People * Michèle Sebag

Michèle Sebag [1]

Michèle Sebag,
a French mathematician and computer scientist, head of Laboratoire de Recherche en Informatique, LRI, French National Centre for Scientific Research, CNRS, Paris-Sud 11 University, and along with Marc Schoenauer head the TAO Project Team [2], National Institute for Research in Computer Science and Control, INRIA, Saclay, Île-de-France. Her research interests include the broad range of artificial intelligence, machine learning, knowledge discovery, stochastic optimization and genetic programming [3].

Selected Publications

[4] [5] [6]

1990 ...

2000 ...

Jérôme Maloberti, Michèle Sebag (2001). θ-Subsumption in a Constraint Satisfaction Perspective. ILP 2001

2005 ...

2010 ...

2015 ...

External Links

References

Up one level