Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Adrien Hardy

dblp:86/11285 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0001-7452-2838ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Information theory · 100%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › information measures › mutual information
MIMO mutual information
0.412019
Mutual Information of Wireless Channels and Block-Jacobi Ergodic Operators · IEEE Trans. Inf. Theory 2019
Information theory › information measures
mutual information
0.412019
Mutual Information of Wireless Channels and Block-Jacobi Ergodic Operators · IEEE Trans. Inf. Theory 2019
Physical-layer communications › MIMO
MIMO channel
0.112019
Mutual Information of Wireless Channels and Block-Jacobi Ergodic Operators · IEEE Trans. Inf. Theory 2019
Physical-layer communications › channel modeling › time-varying channels
time-varying multipath channel
0.112019
Mutual Information of Wireless Channels and Block-Jacobi Ergodic Operators · IEEE Trans. Inf. Theory 2019

Methods — techniques the papers use, named apart from their topics

random matrix theory · 0.8density of states · 0.8block-jacobi ergodic operator · 0.8
YearPublicationVenuePosition
2025 Non-Asymptotic Analysis Of Data Augmentation For Precision Matrix Estimation
abstract
This paper addresses the problem of inverse covariance (also known as precision matrix) estimation in high-dimensional settings. Specifically, we focus on two classes of estimators: linear shrinkage estimators with a target proportional to the identity matrix, and estimators derived from data augmentation (DA). Here, DA refers to the common practice of enriching a dataset with artificial samples—typically generated via a generative model or through random transformations of the original data—prior to model fitting. For both classes of estimators, we derive estimators and provide concentration bounds for their quadratic error. This allows for both method comparison and hyperparameter tuning, such as selecting the optimal proportion of artificial samples. On the technical side, our analysis relies on tools from random matrix theory. We introduce a novel deterministic equivalent for generalized resolvent matrices, accommodating dependent samples with specific structure. We support our theoretical results with numerical experiments.
Lucas Morisset, Adrien Hardy, Alain Durmus
NeurIPS2
2019 Mutual Information of Wireless Channels and Block-Jacobi Ergodic Operators
abstract
Shannon's mutual information of a random multiple antenna and multipath time varying channel is studied in the general case where the process constructed from the channel coefficients is an ergodic and stationary process which is assumed to be available at the receiver. From this viewpoint, the channel can also be represented by an ergodic self-adjoint block-Jacobi operator, which is close in many aspects to a block version of a random Schrödinger operator. The mutual information is then related to the so-called density of states of this operator. In this paper, it is shown that under the weakest assumptions on the channel, the mutual information can be expressed in terms of a matrix-valued stochastic process coupled with the channel process. This allows numerical approximations of the mutual information in this general setting. Moreover, assuming further that the channel coefficient process is a Markov process, a representation for the mutual information offset in the large signal to noise ratio regime is obtained in terms of another related Markov process. This generalizes previous results from Levy et al.. It is also illustrated how the mutual information expressions that are closely related to those predicted by the random matrix theory can be recovered in the large dimensional regime.
Walid Hachem, Adrien Hardy, Shlomo Shamai
IEEE Trans. Inf. Theory2