default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohan Larsson 0002
Person information
- affiliation: Lund University, Department of Statistics, Sweden
Other persons with the same name
- Johan Larsson — disambiguation page
- Johan Larsson 0001 — Epiroc Rock Drills AB, Örebro, Sweden
- Johan Larsson 0003 — Linköping University, Sweden
- Johan Larsson 0004
![[0000-0001-8387-1933]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-8387-1933")
— University of Maryland, College Park, MD, USA (and 1 more) - Johan Larsson 0005 — University of Houston, Houston, TX, USA
- Johan Larsson 0006 — Stockholm University, Kista, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Johan Larsson:
Optimization and Algorithms in Sparse Regression: Screening Rules, Coordinate Descent, and Normalization. Lund University, Sweden, 2024- 2023
- [c5]Johan Larsson, Quentin Klopfenstein, Mathurin Massias, Jonas Wallin:
Coordinate Descent for SLOPE. AISTATS 2023: 4802-4821 - 2022
- [c4]Thomas Moreau, Mathurin Massias, Alexandre Gramfort, Pierre Ablin, Pierre-Antoine Bannier, Benjamin Charlier, Mathieu Dagréou, Tom Dupré la Tour, Ghislain Durif, Cássio F. Dantas, Quentin Klopfenstein, Johan Larsson, En Lai, Tanguy Lefort, Benoît Malézieux, Badr Moufad, Binh T. Nguyen, Alain Rakotomamonjy, Zaccharie Ramzi, Joseph Salmon, Samuel Vaiter:
Benchopt: Reproducible, efficient and collaborative optimization benchmarks. NeurIPS 2022 - [c3]Johan Larsson, Jonas Wallin:
The Hessian Screening Rule. NeurIPS 2022 - [i4]Thomas Moreau, Mathurin Massias, Alexandre Gramfort, Pierre Ablin, Pierre-Antoine Bannier, Benjamin Charlier, Mathieu Dagréou, Tom Dupré la Tour, Ghislain Durif, Cássio F. Dantas, Quentin Klopfenstein, Johan Larsson, En Lai, Tanguy Lefort, Benoît Malézieux, Badr Moufad, Binh T. Nguyen, Alain Rakotomamonjy, Zaccharie Ramzi, Joseph Salmon, Samuel Vaiter:
Benchopt: Reproducible, efficient and collaborative optimization benchmarks. CoRR abs/2206.13424 (2022) - 2021
- [i3]Johan Larsson, Jonas Wallin:
The Hessian Screening Rule. CoRR abs/2104.13026 (2021) - [i2]Johan Larsson:
Look-Ahead Screening Rules for the Lasso. CoRR abs/2105.05648 (2021) - 2020
- [c2]Johan Larsson, Malgorzata Bogdan, Jonas Wallin:
The Strong Screening Rule for SLOPE. NeurIPS 2020 - [i1]Johan Larsson, Malgorzata Bogdan, Jonas Wallin:
The Strong Screening Rule for SLOPE. CoRR abs/2005.03730 (2020)
2010 – 2019
- 2018
- [c1]Johan Larsson, Peter Gustafsson:
A Case Study in Fitting Area-Proportional Euler Diagrams with Ellipses using eulerr. SetVR@Diagrams 2018: 84-91
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 2025-01-21 00:12 CET 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:
