Certifying robustness in inference and learning problems

Magesh, Akshayaa

Permalink

https://hdl.handle.net/2142/129164 Copy

Description

Title

Certifying robustness in inference and learning problems

Author(s)

Magesh, Akshayaa

Issue Date

2025-02-07

Director of Research (if dissertation) or Advisor (if thesis)

Veeravalli, Venugopal V.

Doctoral Committee Chair(s)

Veeravalli, Venugopal V.

Committee Member(s)

• Rayadurgam, Srikant
• Raginsky, Maxim
• Shomorony, Ilan

Department of Study

Electrical & Computer Eng

Discipline

Electrical & Computer Engr

Degree Granting Institution

University of Illinois Urbana-Champaign

Degree Name

Ph.D.

Degree Level

Dissertation

Keyword(s)

• Out-of-Distribution Detection
• Robust Hypothesis Testing
• Distributional Robustness
• Multi-Player Multi-Armed Bandits
• Adversarial Robustness

Abstract

There is a rich literature of algorithms for inference, prediction, and decision-making problems when the underlying distributions governing the data are known and well-modeled. The research from the past few decades has provided powerful learning algorithms when such distributions cannot be easily modeled, for instance with high dimensional data. As a result, such data driven methods are becoming ubiquitous in a wide variety of real-life applications, including safety-critical ones such as self-driving and medical diagnosis. In order for the reliable and safe deployment of such algorithms in practice, there exist several imminent questions to be answered. In this dissertation, a few topics in robustness of inference and learning methods are studied. One of the key issues with data-driven methods in practice is unexpected changes that can occur at inference time potentially affecting the performance of these methods, for instance, deviations in the data generating distributions, irrelevant or unrecognizable inputs, and adversarial attacks from unknown sources. The underlying theme connecting the topics studied in this dissertation is the development of learning algorithms robust to such unexpected, potentially harmful, deviations. Broadly, three problems in robust inference and learning are discussed in this dissertation - out-of-distribution detection for machine learning models, detection robust to distribution shifts, and multi-player multi-armed bandits robust to adversarial attacks. Principled approaches for these problems with theoretical guarantees are derived using tools from statistics, information theory and optimization, that are practical, resilient and efficiently implementable.

Graduation Semester

2025-05

Type of Resource

Thesis

Handle URL

https://hdl.handle.net/2142/129164

Copyright and License Information

Copyright 2025 Akshayaa Magesh

Owning Collections