Logotyp: till Uppsala universitets webbplats

uu.sePublikationer från Uppsala universitet
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat 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 (Engelska)Ingår i: IEEE Open Journal of Signal Processing, E-ISSN 2644-1322, Vol. 1, s. 287-294Artikel i tidskrift (Refereegranskat) 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.

Ort, förlag, år, upplaga, sidor
2020. Vol. 1, s. 287-294
Nyckelord [en]
Data corruption, Huber contamination model, risk minimization, robustness
Nationell ämneskategori
Sannolikhetsteori och statistik
Identifikatorer
URN: urn:nbn:se:uu:diva-429036DOI: 10.1109/OJSP.2020.3039632ISI: 000722891600021OAI: oai:DiVA.org:uu-429036DiVA, id: diva2:1511396
Forskningsfinansiär
Vetenskapsrådet, 2017-04610Vetenskapsrådet, 2018-05040Tillgänglig från: 2020-12-18 Skapad: 2020-12-18 Senast uppdaterad: 2024-01-08Bibliografiskt granskad
Ingår i avhandling
1. Robust machine learning methods
Öppna denna publikation i ny flik eller fönster >>Robust machine learning methods
2022 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
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.

Ort, förlag, år, upplaga, sidor
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
Nyckelord
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
Nationell ämneskategori
Elektroteknik och elektronik Signalbehandling Sannolikhetsteori och statistik
Forskningsämne
Elektroteknik med inriktning mot signalbehandling
Identifikatorer
urn:nbn:se:uu:diva-472453 (URN)978-91-513-1492-1 (ISBN)
Disputation
2022-06-09, 101195, Ångström, Lägerhyddsvägen 1, Uppsala, 13:00 (Engelska)
Opponent
Handledare
Tillgänglig från: 2022-05-12 Skapad: 2022-04-11 Senast uppdaterad: 2022-06-15

Open Access i DiVA

fulltext(1072 kB)560 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 1072 kBChecksumma SHA-512
a5ad95667bab2b94c45e98a7bc3140d83f1e78aab145e7d3b98700ce1c93033fa59dcfb160f0e31bd4071116f031dbb94450ada5c791de5d09e9f7b1187c4280
Typ fulltextMimetyp application/pdf

Övriga länkar

Förlagets fulltext

Person

Osama, MuhammadZachariah, DaveStoica, Petre

Sök vidare i DiVA

Av författaren/redaktören
Osama, MuhammadZachariah, DaveStoica, Petre
Av organisationen
Avdelningen för systemteknikReglerteknik
I samma tidskrift
IEEE Open Journal of Signal Processing
Sannolikhetsteori och statistik

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 562 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 224 träffar
RefereraExporteraLänk till posten
Permanent länk

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