Logo: to the web site of Uppsala University

uu.sePublikasjoner fra Uppsala universitet
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Robust Risk Minimization for Statistical Learning From Corrupted Data
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för systemteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Reglerteknik.ORCID-id: 0000-0002-2294-004X
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för systemteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Reglerteknik.ORCID-id: 0000-0002-6698-0166
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Reglerteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för systemteknik.ORCID-id: 0000-0002-7957-3711
2020 (engelsk)Inngår i: IEEE Open Journal of Signal Processing, E-ISSN 2644-1322, Vol. 1, s. 287-294Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

We consider a general statistical learning problem where an unknown fraction of the training data is corrupted. We develop a robust learning method that only requires specifying an upper bound on the corrupted data fraction. The method minimizes a risk function defined by a non-parametric distribution with unknown probability weights. We derive and analyse the optimal weights and show how they provide robustness against corrupted data. Furthermore, we give a computationally efficient coordinate descent algorithm to solve the risk minimization problem. We demonstrate the wide range applicability of the method, including regression, classification, unsupervised learning and classic parameter estimation, with state-of-the-art performance.

sted, utgiver, år, opplag, sider
2020. Vol. 1, s. 287-294
Emneord [en]
Data corruption, Huber contamination model, risk minimization, robustness
HSV kategori
Identifikatorer
URN: urn:nbn:se:uu:diva-429036DOI: 10.1109/OJSP.2020.3039632ISI: 000722891600021OAI: oai:DiVA.org:uu-429036DiVA, id: diva2:1511396
Forskningsfinansiär
Swedish Research Council, 2017-04610Swedish Research Council, 2018-05040Tilgjengelig fra: 2020-12-18 Laget: 2020-12-18 Sist oppdatert: 2024-01-08bibliografisk kontrollert
Inngår i avhandling
1. Robust machine learning methods
Åpne denne publikasjonen i ny fane eller vindu >>Robust machine learning methods
2022 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
Abstract [en]

We are surrounded by data in our daily lives. The rent of our houses, the amount of electricity units consumed, the prices of different products at a supermarket, the daily temperature, our medicine prescriptions, our internet search history are all different forms of data. Data can be used in a wide range of applications. For example, one can use data to predict product prices in the future; to predict tomorrow's temperature; to recommend videos; or suggest better prescriptions. However in order to do the above, one is required to learn a model from data. A model is a mathematical description of how the phenomena we are interested in behaves e.g. how does the temperature vary? Is it periodic? What kinds of patterns does it have? Machine learning is about this process of learning models from data by building on disciplines such as statistics and optimization. 

Learning models comes with many different challenges. Some challenges are related to how flexible the model is, some are related to the size of data, some are related to computational efficiency etc. One of the challenges is that of data outliers. For instance, due to war in a country exports could stop and there could be a sudden spike in prices of different products. This sudden jump in prices is an outlier or corruption to the normal situation and must be accounted for when learning the model. Another challenge could be that data is collected in one situation but the model is to be used in another situation. For example, one might have data on vaccine trials where the participants were mostly old people. But one might want to make a decision on whether to use the vaccine or not for the whole population that contains people of all age groups. So one must also account for this difference when learning models because the conclusion drawn may not be valid for the young people in the population. Yet another challenge  could arise when data is collected from different sources or contexts. For example, a shopkeeper might have data on sales of paracetamol when there was flu and when there was no flu and she might want to decide how much paracetamol to stock for the next month. In this situation, it is difficult to know whether there will be a flu next month or not and so deciding on how much to stock is a challenge. This thesis tries to address these and other similar challenges.

In paper I, we address the challenge of data corruption i.e., learning models in a robust way when some fraction of the data is corrupted. In paper II, we apply the methodology of paper I to the problem of localization in wireless networks. Paper III addresses the challenge of estimating causal effect between an exposure and an outcome variable from spatially collected data (e.g. whether increasing number of police personnel in an area reduces number of crimes there). Paper IV addresses the challenge of learning improved decision policies e.g. which treatment to assign to which patient given past data on treatment assignments. In paper V, we look at the challenge of learning models when data is acquired from different contexts and the future context is unknown. In paper VI, we address the challenge of predicting count data across space e.g. number of crimes in an area and quantify its uncertainty. In paper VII, we address the challenge of learning models when data points arrive in a streaming fashion i.e., point by point. The proposed method enables online training and also yields some robustness properties.

sted, utgiver, år, opplag, sider
Uppsala: Acta Universitatis Upsaliensis, 2022. s. 50
Serie
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 2147
Emneord
artificial intelligence, machine learning, risk minimization, data corruption, decision policy, conformal methods, data from contexts, online learning, spice, robust, causal inference, point process, localization, distribution uncertainty, treatment rules, quantile treatment, predicting count data
HSV kategori
Forskningsprogram
Elektroteknik med inriktning mot signalbehandling
Identifikatorer
urn:nbn:se:uu:diva-472453 (URN)978-91-513-1492-1 (ISBN)
Disputas
2022-06-09, 101195, Ångström, Lägerhyddsvägen 1, Uppsala, 13:00 (engelsk)
Opponent
Veileder
Tilgjengelig fra: 2022-05-12 Laget: 2022-04-11 Sist oppdatert: 2022-06-15

Open Access i DiVA

fulltext(1072 kB)560 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 1072 kBChecksum SHA-512
a5ad95667bab2b94c45e98a7bc3140d83f1e78aab145e7d3b98700ce1c93033fa59dcfb160f0e31bd4071116f031dbb94450ada5c791de5d09e9f7b1187c4280
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekst

Person

Osama, MuhammadZachariah, DaveStoica, Petre

Søk i DiVA

Av forfatter/redaktør
Osama, MuhammadZachariah, DaveStoica, Petre
Av organisasjonen
I samme tidsskrift
IEEE Open Journal of Signal Processing

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 562 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 224 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf