default search action
Armin Askari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Armin Askari
, Alexandre d'Aspremont
Naive Feature Selection: A Nearly Tight Convex Relaxation for Sparse Naive Bayes. Math. Oper. Res. 49(1): 278-296 (2024) - 2022
- [b1]Armin Askari:
Efficient Optimization Algorithms for Machine Learning. University of California, Berkeley, USA, 2022 - [j3]Armin Askari
Approximation Bounds for Sparse Programs. SIAM J. Math. Data Sci. 4(2): 514-530 (2022) - 2021
- [j2]Armin Askari
FANOK: Knockoffs in Linear Time. SIAM J. Math. Data Sci. 3(3): 833-853 (2021) - [j1]Laurent El Ghaoui
Implicit Deep Learning. SIAM J. Math. Data Sci. 3(3): 930-958 (2021) - 2020
- [c4]Fabian Pedregosa, Geoffrey Négiar, Armin Askari, Martin Jaggi:
Linearly Convergent Frank-Wolfe without Line-Search. AISTATS 2020: 1-10 - [c3]Armin Askari, Alexandre d'Aspremont, Laurent El Ghaoui:
Naive Feature Selection: Sparsity in Naive Bayes. AISTATS 2020: 1813-1822 - [c2]Fangda Gu, Armin Askari, Laurent El Ghaoui:
Fenchel Lifted Networks: A Lagrange Relaxation of Neural Network Training. AISTATS 2020: 3362-3371 - [i9]Armin Askari, Quentin Rebjock, Alexandre d'Aspremont, Laurent El Ghaoui:
FANOK: Knockoffs in Linear Time. CoRR abs/2006.08790 (2020)
2010 – 2019
- 2019
- [i8]Armin Askari, Alexandre d'Aspremont, Laurent El Ghaoui:
Naive Feature Selection: Sparsity in Naive Bayes. CoRR abs/1905.09884 (2019) - [i7]Laurent El Ghaoui, Fangda Gu, Bertrand Travacca, Armin Askari:
Implicit Deep Learning. CoRR abs/1908.06315 (2019) - 2018
- [i6]Armin Askari, Geoffrey Négiar, Rajiv Sambharya, Laurent El Ghaoui:
Lifted Neural Networks. CoRR abs/1805.01532 (2018) - [i5]Armin Askari, Forest Yang, Laurent El Ghaoui:
Kernel-based Outlier Detection using the Inverse Christoffel Function. CoRR abs/1806.06775 (2018) - [i4]Gary Cheng, Armin Askari, Laurent El Ghaoui, Kannan Ramchandran:
Frank-Wolfe Algorithm for Exemplar Selection. CoRR abs/1811.02702 (2018) - [i3]Fangda Gu, Armin Askari, Laurent El Ghaoui:
Fenchel Lifted Networks: A Lagrange Relaxation of Neural Network Training. CoRR abs/1811.08039 (2018) - 2017
- [c1]Armin Askari, Daniel Albarnaz Farias, Alex A. Kurzhanskiy, Pravin Varaiya:
Effect of adaptive and cooperative adaptive cruise control on throughput of signalized arterials. Intelligent Vehicles Symposium 2017: 1287-1292 - [i2]Armin Askari, Daniel Albarnaz Farias, Alex A. Kurzhanskiy, Pravin Varaiya:
Effect of Adaptive and Cooperative Adaptive Cruise Control on Throughput of Signalized Arterials. CoRR abs/1703.01657 (2017) - 2016
- [i1]Armin Askari, Daniel Albarnaz Farias, Alex A. Kurzhanskiy, Pravin Varaiya:
Measuring Impact of Adaptive and Cooperative Adaptive Cruise Control on Throughput of Signalized Intersections. CoRR abs/1611.08973 (2016)
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-10 23:42 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: