default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandre d'Aspremont
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j33]Armin Askari
, Alexandre d'Aspremont, Laurent El Ghaoui:
Naive Feature Selection: A Nearly Tight Convex Relaxation for Sparse Naive Bayes. Math. Oper. Res. 49(1): 278-296 (2024)- [j32]Alexandre d'Aspremont, Cristóbal Guzmán, Clément Lezane:
Optimal Algorithms for Stochastic Complementary Composite Minimization. SIAM J. Optim. 34(1): 163-189 (2024) - [i41]Quentin Peyle, Imene Ben Rejeb-Mzah, Baptiste Piofret, Antoine Benoit, Alexandre d'Aspremont, Adil El Yaalaoui:
Modeling Methane Intensity of Oil and Gas Upstream Activities by Production Profile. CoRR abs/2403.04479 (2024) - [i40]Fajwel Fogel, Yohann Perron, Nikola Besic, Laurent Saint-André, Agnès Pellissier-Tanon, Martin Schwartz, Thomas Boudras, Ibrahim Fayad, Alexandre d'Aspremont, Loïc Landrieu, Philippe Ciais:
Open-Canopy: A Country-Scale Benchmark for Canopy Height Estimation at Very High Resolution. CoRR abs/2407.09392 (2024) - 2023
- [j31]Thomas Kerdreux, Igor Colin, Alexandre d'Aspremont:
Stable Bounds on the Duality Gap of Separable Nonconvex Optimization Problems. Math. Oper. Res. 48(2): 1044-1065 (2023) - [j30]Raghu Bollapragada, Damien Scieur, Alexandre d'Aspremont:
Nonlinear acceleration of momentum and primal-dual algorithms. Math. Program. 198(1): 325-362 (2023) - [i39]Ibrahim Fayad, Philippe Ciais, Martin Schwartz, Jean-Pierre Wigneron, Nicolas N. Baghdadi, Aurélien de Truchis, Alexandre d'Aspremont, Frédéric Frappart, Sassan Saatchi, Agnès Pellissier-Tanon, Hassan Bazzi:
Vision Transformers, a new approach for high-resolution and large-scale mapping of canopy heights. CoRR abs/2304.11487 (2023) - 2022
- [j29]Thomas Kerdreux, Alexandre d'Aspremont, Sebastian Pokutta:
Restarting Frank-Wolfe: Faster Rates under Hölderian Error Bounds. J. Optim. Theory Appl. 192(3): 799-829 (2022) - [j28]Radu-Alexandru Dragomir, Adrien B. Taylor, Alexandre d'Aspremont, Jérôme Bolte:
Optimal complexity and certification of Bregman first-order methods. Math. Program. 194(1): 41-83 (2022) - [j27]Armin Askari, Alexandre d'Aspremont, Laurent El Ghaoui:
Approximation Bounds for Sparse Programs. SIAM J. Math. Data Sci. 4(2): 514-530 (2022) - [j26]Mathieu Barré, Adrien B. Taylor, Alexandre d'Aspremont:
Convergence of a Constrained Vector Extrapolation Scheme. SIAM J. Math. Data Sci. 4(3): 979-1002 (2022) - [i38]Alexandre d'Aspremont, Cristóbal Guzmán, Clément Lezane:
Optimal Algorithms for Stochastic Complementary Composite Minimization. CoRR abs/2211.01758 (2022) - [i37]Alexis Groshenry, Clément Giron, Thomas Lauvaux, Alexandre d'Aspremont, Thibaud Ehret:
Detecting Methane Plumes using PRISMA: Deep Learning Model and Data Augmentation. CoRR abs/2211.15429 (2022) - 2021
- [j25]Alexandre d'Aspremont, Damien Scieur, Adrien B. Taylor:
Acceleration Methods. Found. Trends Optim. 5(1-2): 1-245 (2021) - [j24]Alexandre d'Aspremont, Mihai Cucuringu, Hemant Tyagi:
Ranking and synchronization from pairwise measurements via SVD. J. Mach. Learn. Res. 22: 19:1-19:63 (2021) - [j23]Thomas Kerdreux, Christophe Roux, Alexandre d'Aspremont, Sebastian Pokutta:
Linear Bandits on Uniformly Convex Sets. J. Mach. Learn. Res. 22: 284:1-284:23 (2021) - [j22]Radu-Alexandru Dragomir, Alexandre d'Aspremont, Jérôme Bolte:
Quartic First-Order Methods for Low-Rank Minimization. J. Optim. Theory Appl. 189(2): 341-363 (2021) - [j21]Armin Askari, Quentin Rebjock, Alexandre d'Aspremont, Laurent El Ghaoui:
FANOK: Knockoffs in Linear Time. SIAM J. Math. Data Sci. 3(3): 833-853 (2021) - [c28]Thomas Kerdreux, Alexandre d'Aspremont, Sebastian Pokutta:
Projection-Free Optimization on Uniformly Convex Sets. AISTATS 2021: 19-27 - [c27]Grégoire Mialon, Dexiong Chen, Alexandre d'Aspremont, Julien Mairal:
A Trainable Optimal Transport Embedding for Feature Aggregation and its Relationship to Attention. ICLR 2021 - [i36]Alexandre d'Aspremont, Damien Scieur, Adrien B. Taylor:
Acceleration Methods. CoRR abs/2101.09545 (2021) - [i35]Thomas Kerdreux, Alexandre d'Aspremont, Sebastian Pokutta:
Local and Global Uniform Convexity Conditions. CoRR abs/2102.05134 (2021) - [i34]Thomas Kerdreux, Christophe Roux, Alexandre d'Aspremont, Sebastian Pokutta:
Linear Bandits on Uniformly Convex Sets. CoRR abs/2103.05907 (2021) - 2020
- [j20]Damien Scieur, Alexandre d'Aspremont, Francis R. Bach:
Regularized nonlinear acceleration. Math. Program. 179(1): 47-83 (2020) - [j19]Vincent Roulet, Alexandre d'Aspremont:
Sharpness, Restart, and Acceleration. SIAM J. Optim. 30(1): 262-289 (2020) - [c26]François-Pierre Paty, Alexandre d'Aspremont, Marco Cuturi:
Regularity as Regularization: Smooth and Strongly Convex Brenier Potentials in Optimal Transport. AISTATS 2020: 1222-1232 - [c25]Armin Askari, Alexandre d'Aspremont, Laurent El Ghaoui:
Naive Feature Selection: Sparsity in Naive Bayes. AISTATS 2020: 1813-1822 - [c24]Grégoire Mialon, Julien Mairal, Alexandre d'Aspremont:
Screening Data Points in Empirical Risk Minimization via Ellipsoidal Regions and Safe Loss Functions. AISTATS 2020: 3610-3620 - [c23]Mathieu Barré, Adrien B. Taylor, Alexandre d'Aspremont:
Complexity Guarantees for Polyak Steps with Momentum. COLT 2020: 452-478 - [i33]Mathieu Barré, Adrien B. Taylor, Alexandre d'Aspremont:
Complexity Guarantees for Polyak Steps with Momentum. CoRR abs/2002.00915 (2020) - [i32]Alexandre d'Aspremont, Mert Pilanci:
Global Convergence of Frank Wolfe on One Hidden Layer Networks. CoRR abs/2002.02208 (2020) - [i31]Armin Askari, Quentin Rebjock, Alexandre d'Aspremont, Laurent El Ghaoui:
FANOK: Knockoffs in Linear Time. CoRR abs/2006.08790 (2020) - [i30]Grégoire Mialon, Dexiong Chen, Alexandre d'Aspremont, Julien Mairal:
An Optimal Transport Kernel for Feature Aggregation and its Relationship to Attention. CoRR abs/2006.12065 (2020) - [i29]Mathieu Barré, Clément Giron, Matthieu Mazzolini, Alexandre d'Aspremont:
Averaging Atmospheric Gas Concentration Data using Wasserstein Barycenters. CoRR abs/2010.02762 (2020) - [i28]Mathieu Barré, Adrien B. Taylor, Alexandre d'Aspremont:
Convergence of Constrained Anderson Acceleration. CoRR abs/2010.15482 (2020) - [i27]Manon Romain, Alexandre d'Aspremont:
A Bregman Method for Structure Learning on Sparse Directed Acyclic Graphs. CoRR abs/2011.02764 (2020)
2010 – 2019
- 2019
- [c22]Raghu Bollapragada, Damien Scieur, Alexandre d'Aspremont:
Nonlinear Acceleration of Primal-Dual Algorithms. AISTATS 2019: 739-747 - [c21]Thomas Kerdreux, Alexandre d'Aspremont, Sebastian Pokutta:
Restarting Frank-Wolfe. AISTATS 2019: 1275-1283 - [c20]Anastasia Podosinnikova, Amelia Perry, Alexander S. Wein, Francis R. Bach, Alexandre d'Aspremont, David A. Sontag:
Overcomplete Independent Component Analysis via SDP. AISTATS 2019: 2583-2592 - [i26]Anastasia Podosinnikova, Amelia Perry, Alexander S. Wein, Francis R. Bach, Alexandre d'Aspremont, David A. Sontag:
Overcomplete Independent Component Analysis via SDP. CoRR abs/1901.08334 (2019) - [i25]Armin Askari, Alexandre d'Aspremont, Laurent El Ghaoui:
Naive Feature Selection: Sparsity in Naive Bayes. CoRR abs/1905.09884 (2019) - [i24]François-Pierre Paty, Alexandre d'Aspremont, Marco Cuturi:
Regularity as Regularization: Smooth and Strongly Convex Brenier Potentials in Optimal Transport. CoRR abs/1905.10812 (2019) - [i23]Alexandre d'Aspremont, Mihai Cucuringu, Hemant Tyagi:
Ranking and synchronization from pairwise measurements via SVD. CoRR abs/1906.02746 (2019) - [i22]Radu-Alexandru Dragomir, Adrien B. Taylor, Alexandre d'Aspremont, Jérôme Bolte:
Optimal Complexity and Certification of Bregman First-Order Methods. CoRR abs/1911.08510 (2019) - [i21]Grégoire Mialon, Alexandre d'Aspremont, Julien Mairal:
Screening Data Points in Empirical Risk Minimization via Ellipsoidal Regions and Safe Loss Function. CoRR abs/1912.02566 (2019) - 2018
- [j18]Alexandre d'Aspremont, Cristóbal Guzmán, Martin Jaggi:
Optimal Affine-Invariant Smooth Minimization Algorithms. SIAM J. Optim. 28(3): 2384-2405 (2018) - [c19]Damien Scieur, Edouard Oyallon, Alexandre d'Aspremont, Francis R. Bach:
Nonlinear Acceleration of CNNs. ICLR (Workshop) 2018 - [c18]Thomas Kerdreux, Fabian Pedregosa, Alexandre d'Aspremont:
Frank-Wolfe with Subsampling Oracle. ICML 2018: 2596-2605 - [i20]Thomas Kerdreux, Fabian Pedregosa, Alexandre d'Aspremont:
Frank-Wolfe with Subsampling Oracle. CoRR abs/1803.07348 (2018) - [i19]Damien Scieur, Edouard Oyallon, Alexandre d'Aspremont, Francis R. Bach:
Nonlinear Acceleration of Deep Neural Networks. CoRR abs/1805.09639 (2018) - [i18]Damien Scieur, Edouard Oyallon, Alexandre d'Aspremont, Francis R. Bach:
Nonlinear Acceleration of CNNs. CoRR abs/1806.00370 (2018) - [i17]Antoine Recanati, Thomas Kerdreux, Alexandre d'Aspremont:
Reconstructing Latent Orderings by Spectral Clustering. CoRR abs/1807.07122 (2018) - 2017
- [j17]Antoine Recanati, Thomas Brüls, Alexandre d'Aspremont:
A spectral algorithm for fast de novo layout of uncorrected long nanopore reads. Bioinform. 33(20): 3188-3194 (2017) - [c17]Damien Scieur, Vincent Roulet, Francis R. Bach, Alexandre d'Aspremont:
Integration Methods and Optimization Algorithms. NIPS 2017: 1109-1118 - [c16]Vincent Roulet, Alexandre d'Aspremont:
Sharpness, Restart and Acceleration. NIPS 2017: 1119-1129 - [c15]Damien Scieur, Francis R. Bach, Alexandre d'Aspremont:
Nonlinear Acceleration of Stochastic Algorithms. NIPS 2017: 3982-3991 - 2016
- [j16]Fajwel Fogel, Alexandre d'Aspremont, Milan Vojnovic:
Spectral Ranking using Seriation. J. Mach. Learn. Res. 17: 88:1-88:45 (2016) - [j15]Fajwel Fogel, Irène Waldspurger, Alexandre d'Aspremont:
Phase retrieval for imaging problems. Math. Program. Comput. 8(3): 311-335 (2016) - [c14]Damien Scieur, Alexandre d'Aspremont, Francis R. Bach:
Regularized Nonlinear Acceleration. NIPS 2016: 712-720 - 2015
- [j14]Irène Waldspurger, Alexandre d'Aspremont, Stéphane Mallat:
Phase recovery, MaxCut and complex semidefinite programming. Math. Program. 149(1-2): 47-81 (2015) - [j13]Fajwel Fogel, Rodolphe Jenatton, Francis R. Bach, Alexandre d'Aspremont:
Convex Relaxations for Permutation Problems. SIAM J. Matrix Anal. Appl. 36(4): 1465-1488 (2015) - [i16]Vincent Roulet, Fajwel Fogel, Alexandre d'Aspremont, Francis R. Bach:
Supervised Clustering in the Data Cube. CoRR abs/1506.04908 (2015) - 2014
- [j12]Alexandre d'Aspremont, Francis R. Bach, Laurent El Ghaoui:
Approximation bounds for sparse principal component analysis. Math. Program. 148(1-2): 89-110 (2014) - [j11]Alexandre d'Aspremont, Noureddine El Karoui:
A Stochastic Smoothing Algorithm for Semidefinite Programming. SIAM J. Optim. 24(3): 1138-1177 (2014) - [c13]Fajwel Fogel, Alexandre d'Aspremont, Milan Vojnovic:
SerialRank: Spectral Ranking using Seriation. NIPS 2014: 900-908 - [c12]Kevin Vervier, Pierre Mahé, Alexandre d'Aspremont, Jean-Baptiste Veyrieras, Jean-Philippe Vert:
On Learning Matrices with Orthogonal Columns or Disjoint Supports. ECML/PKDD (3) 2014: 274-289 - [i15]Fajwel Fogel, Alexandre d'Aspremont, Milan Vojnovic:
Spectral Ranking using Seriation. CoRR abs/1406.5370 (2014) - 2013
- [j10]Alexandre d'Aspremont, Noureddine El Karoui:
Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics. Math. Oper. Res. 38(2): 228-247 (2013) - [c11]Marco Cuturi, Alexandre d'Aspremont:
Mean Reversion with a Variance Threshold. ICML (3) 2013: 271-279 - [c10]Fajwel Fogel, Rodolphe Jenatton, Francis R. Bach, Alexandre d'Aspremont:
Convex Relaxations for Permutation Problems. NIPS 2013: 1016-1024 - 2011
- [j9]Alexandre d'Aspremont, Francis R. Bach, Inderjit S. Dhillon, Bin Yu:
Preface. Math. Program. 127(1): 1-2 (2011) - [j8]Alexandre d'Aspremont, Laurent El Ghaoui:
Testing the nullspace property using semidefinite programming. Math. Program. 127(1): 123-144 (2011) - 2010
- [i14]Francis R. Bach, Selin Damla Ahipasaoglu, Alexandre d'Aspremont:
Convex Relaxations for Subset Selection. CoRR abs/1006.3601 (2010)
2000 – 2009
- 2009
- [j7]Ronny Luss, Alexandre d'Aspremont:
Support vector machine classification with indefinite kernels. Math. Program. Comput. 1(2-3): 97-118 (2009) - [c9]Marco Cuturi, Jean-Philippe Vert, Alexandre d'Aspremont:
White Functionals for Anomaly Detection in Dynamical Systems. NIPS 2009: 432-440 - 2008
- [j6]Onureena Banerjee, Laurent El Ghaoui, Alexandre d'Aspremont:
Model Selection Through Sparse Maximum Likelihood Estimation for Multivariate Gaussian or Binary Data. J. Mach. Learn. Res. 9: 485-516 (2008) - [j5]Alexandre d'Aspremont, Francis R. Bach, Laurent El Ghaoui:
Optimal Solutions for Sparse Principal Component Analysis. J. Mach. Learn. Res. 9: 1269-1294 (2008) - [j4]Alexandre d'Aspremont:
Smooth Optimization with Approximate Gradient. SIAM J. Optim. 19(3): 1171-1183 (2008) - [j3]Alexandre d'Aspremont, Onureena Banerjee, Laurent El Ghaoui:
First-Order Methods for Sparse Covariance Selection. SIAM J. Matrix Anal. Appl. 30(1): 56-66 (2008) - [i13]Ronny Luss, Alexandre d'Aspremont:
Support Vector Machine Classification with Indefinite Kernels. CoRR abs/0804.0188 (2008) - [i12]Ronny Luss, Alexandre d'Aspremont:
A Cutting Plane Method for Multiple Kernel Learning. CoRR abs/0809.2792 (2008) - 2007
- [j2]Alexandre d'Aspremont, Laurent El Ghaoui, Michael I. Jordan, Gert R. G. Lanckriet:
A Direct Formulation for Sparse PCA Using Semidefinite Programming. SIAM Rev. 49(3): 434-448 (2007) - [c8]Alexandre d'Aspremont, Francis R. Bach, Laurent El Ghaoui:
Full regularization path for sparse principal component analysis. ICML 2007: 177-184 - [c7]Ronny Luss, Alexandre d'Aspremont:
Support Vector Machine Classification with Indefinite Kernels. NIPS 2007: 953-960 - [c6]Alexandre d'Aspremont, Laurent El Ghaoui:
A Semidefinite Relaxation for Air Traffic Flow Scheduling. RIVF 2007: 103-107 - [i11]Ronny Luss, Alexandre d'Aspremont:
Clustering and Feature Selection using Sparse Principal Component Analysis. CoRR abs/0707.0701 (2007) - [i10]Onureena Banerjee, Laurent El Ghaoui, Alexandre d'Aspremont:
Model Selection Through Sparse Maximum Likelihood Estimation. CoRR abs/0707.0704 (2007) - [i9]Alexandre d'Aspremont, Francis R. Bach, Laurent El Ghaoui:
Optimal Solutions for Sparse Principal Component Analysis. CoRR abs/0707.0705 (2007) - [i8]Alexandre d'Aspremont:
Identifying Small Mean Reverting Portfolios. CoRR abs/0708.3048 (2007) - 2006
- [j1]Alexandre d'Aspremont, Laurent El Ghaoui:
Static arbitrage bounds on basket option prices. Math. Program. 106(3): 467-489 (2006) - [c5]Onureena Banerjee, Laurent El Ghaoui, Alexandre d'Aspremont, Georges Natsoulis:
Convex optimization techniques for fitting sparse Gaussian graphical models. ICML 2006: 89-96 - [c4]Alexandre d'Aspremont, Devan Sohier, Arnab Nilim, Laurent El Ghaoui, Vu Duong:
Optimal path planning for air traffic flow management under stochastic weather and capacity constraints. RIVF 2006: 1-6 - [c3]Frédéric Ferchaud, Alexandre d'Aspremont:
Reallocation time calculation according to slot occupation rate. RIVF 2006: 75-80 - [i7]Alexandre d'Aspremont, Laurent El Ghaoui:
A Semidefinite Relaxation for Air Traffic Flow Scheduling. CoRR abs/cs/0609145 (2006) - 2005
- [i6]Onureena Banerjee, Alexandre d'Aspremont, Laurent El Ghaoui:
Sparse Covariance Selection via Robust Maximum Likelihood Estimation. CoRR abs/cs/0506023 (2005) - [i5]Alexandre d'Aspremont:
A Market Test for the Positivity of Arrow-Debreu Prices. CoRR abs/cs/0510027 (2005) - 2004
- [c2]Alexandre d'Aspremont, Laurent El Ghaoui, Michael I. Jordan, Gert R. G. Lanckriet:
A Direct Formulation for Sparse PCA Using Semidefinite Programming. NIPS 2004: 41-48 - [i4]Alexandre d'Aspremont, Laurent El Ghaoui, Michael I. Jordan, Gert R. G. Lanckriet:
A direct formulation for sparse PCA using semidefinite programming. CoRR cs.CE/0406021 (2004) - [i3]Alexandre d'Aspremont:
Static versus Dynamic Arbitrage Bounds on Multivariate Option Prices. CoRR cs.CE/0407029 (2004) - 2003
- [c1]Alexandre d'Aspremont:
A semidefinite representation for some minimum cardinality problems. CDC 2003: 4985-4990 - [i2]Alexandre d'Aspremont:
Interest Rate Model Calibration Using Semidefinite Programming. CoRR cs.CE/0302034 (2003) - [i1]Alexandre d'Aspremont:
Risk-Management Methods for the Libor Market Model Using Semidefinite Programming. CoRR cs.CE/0302035 (2003)
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-09-13 01:38 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:
