← Search

Mikael Skoglund

16 accepted papers

2026

An Information Geometric Approach to Fairness With Equalized Odds Constraint

ICASSP 2026oral

We study the statistical design of a fair mechanism that attains equalized odds, where an agent uses some useful data (database) $X$ to solve a task $T$. Since both $X$ and $T$ are correlated with some latent sensitive attribute $S$, the agent designs a representation $Y$ that satisfies an equalized…

Cited by 0SourcePDFScholar
2025

An Information-Theoretic Analysis of Thompson Sampling with Infinite Action Spaces

ICASSP 2025accepted

This paper studies the Bayesian regret of the Thompson Sampling algorithm for bandit problems, building on the information-theoretic framework introduced by Russo and Van Roy [1]. Specifically, it extends the rate-distortion analysis of Dong and Van Roy [2], which provides near-optimal bounds for li…

Cited by 0SourceScholar
2025

Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality

ICASSP 2025accepted

We study agents acting in an unknown environment where the agent’s goal is to find a robust policy. We consider robust policies as policies that achieve high cumulative rewards for all possible environments. To this end, we consider agents minimizing the maximum regret over different environment par…

Cited by 0SourceScholar
2025

Near-Field ISAC in 6G: Addressing Phase Nonlinearity via Lifted Super-Resolution

ICASSP 2025accepted

Integrated sensing and communications (ISAC) is a promising component of 6G networks, fusing communication and radar technologies to facilitate new services. Additionally, the use of extremely large-scale antenna arrays (ELAA) at the ISAC common receiver not only facilitates terahertz-rate communica…

Cited by 0SourceScholar
2021

A ReLU Dense Layer to Improve the Performance of Neural Networks

ICASSP 2021accepted

We propose ReDense as a simple and low complexity way to improve the performance of trained neural networks. We use a combination of random weights and rectified linear unit (ReLU) activation function to add a ReLU dense (ReDense) layer to the trained neural network such that it can achieve a lower…

Cited by 0SourceScholar
2021

Tighter Expected Generalization Error Bounds via Wasserstein Distance

NeurIPS 2021poster

This work presents several expected generalization error bounds based on the Wasserstein distance. More specifically, it introduces full-dataset, single-letter, and random-subset bounds, and their analogous in the randomized subsample setting from Steinke and Zakynthinou [1]. Moreover, when the loss…

Cited by 52SourcePDFScholar
2020

Asynchrounous Decentralized Learning of a Neural Network

ICASSP 2020accepted

In this work, we exploit an asynchronous computing framework namely ARock to learn a deep neural network called self-size estimating feedforward neural network (SSFN) in a decentralized scenario. Using this algorithm namely asynchronous decentralized SSFN (dSSFN), we provide the centralized equivale…

Cited by 0SourceScholar
2020

Hidden Markov Models for Sepsis Detection in Preterm Infants

ICASSP 2020accepted

We explore the use of traditional and contemporary hidden Markov models (HMMs) for sequential physiological data analysis and sepsis prediction in preterm infants. We investigate the use of classical Gaussian mixture model based HMM, and a recently proposed neural network based HMM. To improve the n…

Cited by 0SourceScholar
2020

High-Dimensional Neural Feature Using Rectified Linear Unit And Random Matrix Instance

ICASSP 2020accepted

We design a ReLU-based multilayer neural network to generate a rich high-dimensional feature vector. The feature guarantees a monotonically decreasing training cost as the number of layers increases. We design the weight matrix in each layer to extend the feature vectors to a higher dimensional spac…

Cited by 0SourceScholar
2019

Compressive Sensing with Applications to Millimeter-wave Architectures

ICASSP 2019accepted

To make the system available at low-cost, millimeter-wave (mmWave) multiple-input multiple-output (MIMO) architectures employ analog arrays, which are driven by a limited number of radio frequency (RF) chains. One primary challenge of using large hybrid analog-digital arrays is that the digital base…

Cited by 0SourceScholar
2019

Learning and Data Selection in Big Datasets

ICML 2019oral

Finding a dataset of minimal cardinality to characterize the optimal parameters of a model is of paramount importance in machine learning and distributed optimization over a network. This paper investigates the compressibility of large datasets. More specifically, we propose a framework that jointly…

Cited by 17SourcePDFScholar
2018

Distributed Large Neural Network with Centralized Equivalence

ICASSP 2018accepted

In this article, we develop a distributed algorithm for learning a large neural network that is deep and wide. We consider a scenario where the training dataset is not available in a single processing node, but distributed among several nodes. We show that a recently proposed large neural network ar…

Cited by 0SourceScholar