default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabien Lauer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Fabien Lauer
:
Margin-Based Scenario Approach to Robust Optimization in High Dimension. IEEE Trans. Autom. Control. 69(10): 7182-7189 (2024)- 2023
- [i9]Fabien Lauer:
Uniform Risk Bounds for Learning with Dependent Data Sequences. CoRR abs/2303.11650 (2023) - 2022
- [j19]Louis Massucci, Fabien Lauer, Marion Gilson:
A statistical learning perspective on switched linear system identification. Autom. 145: 110532 (2022) - 2021
- [c15]Louis Massucci, Fabien Lauer, Marion Gilson:
Regularized Switched System Identification: a Statistical Learning Perspective. ADHS 2021: 55-60 - 2020
- [j18]Fabien Lauer:
Error Bounds for Piecewise Smooth and Switching Regression. IEEE Trans. Neural Networks Learn. Syst. 31(4): 1183-1195 (2020) - [c14]Fabien Lauer:
Risk Bounds for Learning Multiple Components with Permutation-Invariant Losses. AISTATS 2020: 1178-1187 - [c13]Louis Massucci, Fabien Lauer, Marion Gilson:
Structural Risk Minimization for Switched System Identification. CDC 2020: 1002-1007
2010 – 2019
- 2019
- [b1]Fabien Lauer:
Optimization and statistical learning theory for piecewise smooth and switching regression. (Optimisation et théorie statistique de l'apprentissage pour la régression douce par morceaux et à commutations). University of Lorraine, Nancy, France, 2019 - [j17]Khadija Musayeva, Fabien Lauer, Yann Guermeur:
Rademacher complexity and generalization performance of multi-category margin classifiers. Neurocomputing 342: 6-15 (2019) - [i8]Fabien Lauer:
Risk Bounds for Learning Multiple Components with Permutation-Invariant Losses. CoRR abs/1904.07594 (2019) - 2018
- [j16]Fabien Lauer:
Global optimization for low-dimensional switching linear regression and bounded-error estimation. Autom. 89: 73-82 (2018) - [j15]Fabien Lauer:
MLweb: A toolkit for machine learning on the web. Neurocomputing 282: 74-77 (2018) - [j14]Fabien Lauer:
On the exact minimization of saturated loss functions for robust regression and subspace estimation. Pattern Recognit. Lett. 112: 317-323 (2018) - [c12]Khadija Musayeva, Fabien Lauer, Yann Guermeur:
A sharper bound on the Rademacher complexity of margin multi-category classifiers. ESANN 2018 - [i7]Fabien Lauer:
On the exact minimization of saturated loss functions for robust regression and subspace estimation. CoRR abs/1806.05833 (2018) - 2017
- [i6]Fabien Lauer:
Global optimization for low-dimensional switching linear regression and bounded-error estimation. CoRR abs/1707.05533 (2017) - [i5]Fabien Lauer:
Error Bounds for Piecewise Smooth and Switching Regression. CoRR abs/1707.07938 (2017) - 2016
- [j13]Fabien Lauer:
On the complexity of switching linear regression. Autom. 74: 80-83 (2016) - 2015
- [j12]Fabien Lauer:
On the complexity of piecewise affine system identification. Autom. 62: 148-153 (2015) - [j11]Fabien Lauer, Henrik Ohlsson:
Finding sparse solutions of systems of polynomial equations via group-sparsity optimization. J. Glob. Optim. 62(2): 319-349 (2015) - [c11]Emmanuel Didiot, Fabien Lauer:
Efficient Optimization of Multi-class Support Vector Machines with MSVMpack. MCO (2) 2015: 23-34 - [i4]Fabien Lauer:
On the complexity of piecewise affine system identification. CoRR abs/1509.02348 (2015) - [i3]Fabien Lauer:
On the complexity of switching linear regression. CoRR abs/1510.06920 (2015) - 2014
- [j10]Tao Pham Dinh, Le Hoai Minh, Hoai An Le Thi, Fabien Lauer:
A Difference of Convex Functions Algorithm for Switched Linear Regression. IEEE Trans. Autom. Control. 59(8): 2277-2282 (2014) - [j9]Van Luong Le, Fabien Lauer, Gérard Bloch:
Selective ℓ1 Minimization for Sparse Recovery. IEEE Trans. Autom. Control. 59(11): 3008-3013 (2014) - [c10]Fabien Lauer, Gérard Bloch:
Piecewise smooth system identification in reproducing kernel Hilbert space. CDC 2014: 6498-6503 - [i2]Fabien Lauer, Henrik Ohlsson:
Sparse phase retrieval via group-sparse optimization. CoRR abs/1402.5803 (2014) - 2013
- [c9]Laurent Bako, Van Luong Le, Fabien Lauer, Gérard Bloch:
Identification of MIMO switched state-space models. ACC 2013: 71-76 - [c8]Van Luong Le, Fabien Lauer, Gérard Bloch:
Identification of linear hybrid systems: A geometric approach. ACC 2013: 830-835 - [c7]Van Luong Le, Fabien Lauer, Laurent Bako, Gérard Bloch:
Learning nonlinear hybrid systems: from sparse optimization to support vector regression. HSCC 2013: 33-42 - [i1]Fabien Lauer, Henrik Ohlsson:
Finding sparse solutions of systems of polynomial equations via group-sparsity optimization. CoRR abs/1311.5871 (2013) - 2012
- [c6]Fabien Lauer, Van Luong Le, Gérard Bloch:
Learning smooth models of nonsmooth functions via convex optimization. MLSP 2012: 1-6 - [c5]Fabienne Thomarat, Fabien Lauer, Yann Guermeur:
Cascading Discriminant and Generative Models for Protein Secondary Structure Prediction. PRIB 2012: 166-177 - 2011
- [j8]Fabien Lauer, Gérard Bloch, René Vidal:
A continuous optimization framework for hybrid system identification. Autom. 47(3): 608-613 (2011) - [j7]Fabien Lauer, Yann Guermeur:
MSVMpack: A Multi-Class Support Vector Machine Package. J. Mach. Learn. Res. 12: 2293-2296 (2011) - [j6]Van Luong Le, Gérard Bloch, Fabien Lauer:
Reduced-Size Kernel Models for Nonlinear Hybrid System Identification. IEEE Trans. Neural Networks 22(12): 2398-2405 (2011) - 2010
- [c4]Fabien Lauer, Gérard Bloch, René Vidal:
Nonlinear hybrid system identification with kernel models. CDC 2010: 696-701
2000 – 2009
- 2009
- [c3]Fabien Lauer, Christoph Schnörr:
Spectral clustering of linear subspaces for motion segmentation. ICCV 2009: 678-685 - 2008
- [j5]Fabien Lauer, Gérard Bloch:
Incorporating prior knowledge in support vector machines for classification: A review. Neurocomputing 71(7-9): 1578-1594 (2008) - [j4]Gérard Bloch, Fabien Lauer, Guillaume Colin, Yann Chamaillard:
Support vector regression from simulation data and few experimental samples. Inf. Sci. 178(20): 3813-3827 (2008) - [j3]Fabien Lauer, Gérard Bloch:
Incorporating prior knowledge in support vector regression. Mach. Learn. 70(1): 89-118 (2008) - [c2]Fabien Lauer, Gérard Bloch:
Switched and PieceWise Nonlinear Hybrid System Identification. HSCC 2008: 330-343 - [p1]Gérard Bloch, Fabien Lauer, Guillaume Colin:
On Learning Machines for Engine Control. Computational Intelligence in Automotive Applications 2008: 125-144 - 2007
- [j2]Fabien Lauer, Ching Y. Suen, Gérard Bloch:
A trainable feature extractor for handwritten digit recognition. Pattern Recognit. 40(6): 1816-1824 (2007) - 2006
- [j1]Fabien Lauer, Gérard Bloch:
Ho-Kashyap classifier with early stopping for regularization. Pattern Recognit. Lett. 27(9): 1037-1044 (2006) - 2004
- [c1]Fabien Lauer, Mohamed Bentoumi, Gérard Bloch, Gilles Millerioux, Patrice Aknin:
Ho-Kashyap with Early Stopping Versus Soft Margin SVM for Linear Classifiers - An Application. ISNN (1) 2004: 524-530
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
