<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-14T07:20:52Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:10230/72104" metadataPrefix="qdc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:10230/72104</identifier><datestamp>2025-12-06T17:21:49Z</datestamp><setSpec>com_2072_6</setSpec><setSpec>col_2072_452952</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Regularization, sparse recovery, and median-of-means tournaments</dc:title>
   <dc:creator>Lugosi, Gábor</dc:creator>
   <dc:creator>Mendelson, Shahar</dc:creator>
   <dc:subject>Lasso</dc:subject>
   <dc:subject>Median-of-means tournament</dc:subject>
   <dc:subject>Regularized risk minimization</dc:subject>
   <dc:subject>Robust regression</dc:subject>
   <dc:subject>Slope</dc:subject>
   <dcterms:abstract>We introduce a regularized risk minimization procedure for regression function estimation. The procedure is based on median-of-means tournaments, introduced by the authors in Lugosi and Mendelson (2018) and achieves near optimal accuracy and confidence under general conditions, including heavy-tailed predictor and response variables. It outperforms standard regularized empirical risk minimization procedures such as LASSO or SLOPE in heavy-tailed problems.</dcterms:abstract>
   <dcterms:abstract>Gábor Lugosi was supported by the Spanish Ministry of Economy and Competitiveness, Grant MTM2015-67304-P and FEDER, EU; "High-dimensional problems in structured probabilistic models" -- Ayudas Fundacion BBVA a Equipos de Investigación Científica 2017; and Google Focused Award "Algorithms and Learning for AI". Shahar Mendelson was supported in part by the Israel Science Foundation.</dcterms:abstract>
   <dcterms:dateAccepted>2025-12-06T17:21:49Z</dcterms:dateAccepted>
   <dcterms:available>2025-12-06T17:21:49Z</dcterms:available>
   <dcterms:created>2025-12-06T17:21:49Z</dcterms:created>
   <dcterms:issued>2025-12-02T14:22:31Z</dcterms:issued>
   <dcterms:issued>2025-12-02T14:22:31Z</dcterms:issued>
   <dcterms:issued>2019</dcterms:issued>
   <dcterms:issued>2025-12-02T14:22:31Z</dcterms:issued>
   <dc:type>info:eu-repo/semantics/article</dc:type>
   <dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
   <dc:identifier>http://hdl.handle.net/10230/72104</dc:identifier>
   <dc:relation>Bernoulli: Official Publication of the Bernoulli Society for Mathematical Statistics and Probability. 2019;25(3):2075-2106</dc:relation>
   <dc:relation>info:eu-repo/grantAgreement/ES/1PE/MTM2015-67304-P</dc:relation>
   <dc:rights>© 2019 Bernoulli Society for Mathematical Statistics and Probability</dc:rights>
   <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
   <dc:publisher>Bernoulli Society for Mathematical Statistics and Probability</dc:publisher>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>