![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
IEEE Journal on Selected Areas in Information Theory, Volume 5
Volume 5, 2024
- Venugopal V. Veeravalli
, Georgios Fellouris
, George V. Moustakides
:
Quickest Change Detection With Controlled Sensing. 1-11 - Antonious M. Girgis
, Suhas N. Diggavi
:
Multi-Message Shuffled Privacy in Federated Learning. 12-27 - Anand Jerry George, Lekshmi Ramesh, Aditya Vikram Singh
, Himanshu Tyagi
:
Continual Mean Estimation Under User-Level Privacy. 28-43 - Matteo Zecchin
, Sangwoo Park
, Osvaldo Simeone
:
Forking Uncertainties: Reliable Prediction and Model Predictive Control With Sequence Models via Conformal Risk Control. 44-61 - Chen Xu
, Jonghyeok Lee, Xiuyuan Cheng
, Yao Xie
:
Flow-Based Distributionally Robust Optimization. 62-77 - Zirui Yan
, Arpan Mukherjee
, Burak Varici, Ali Tajer
:
Robust Causal Bandits for Linear Models. 78-93 - Ruida Zhou
, Chao Tian
, Tie Liu
:
Exactly Tight Information-Theoretic Generalization Error Bound for the Quadratic Gaussian Problem. 94-104 - Alireza Sadeghi
, Gang Wang
, Georgios B. Giannakis
:
Learning Robust to Distributional Uncertainties and Adversarial Data. 105-122 - Hyun-Young Park
, Seung-Hyun Nam
, Si-Hyeon Lee
:
Exactly Optimal and Communication-Efficient Private Estimation via Block Designs. 123-134 - Osama A. Hanna
, Antonious M. Girgis
, Christina Fragouli
, Suhas N. Diggavi
:
Differentially Private Stochastic Linear Bandits: (Almost) for Free. 135-147 - Neophytos Charalambides
, Hessam Mahdavifar
, Mert Pilanci
, Alfred O. Hero III
:
Iterative Sketching for Secure Coded Regression. 148-161 - Sahel Torkamani, Javad B. Ebrahimi
, Parastoo Sadeghi
, Rafael G. L. D'Oliveira
, Muriel Médard
:
Optimal Binary Differential Privacy via Graphs. 162-174 - Xinying Zou
, Samir M. Perlaza
, Iñaki Esnaola
, Eitan Altman
, H. Vincent Poor
:
The Worst-Case Data-Generating Probability Measure in Statistical Learning. 175-189 - Songtao Feng
, Ming Yin, Ruiquan Huang, Yu-Xiang Wang
, Jing Yang
, Yingbin Liang
:
Toward General Function Approximation in Nonstationary Reinforcement Learning. 190-206 - Elena Ghazi
, Ibrahim Issa
:
Total Variation Meets Differential Privacy. 207-220 - Daria Reshetova
, Wei-Ning Chen
, Ayfer Özgür
:
Training Generative Models From Privatized Data via Entropic Optimal Transport. 221-235 - Sundara Rajan Srinivasavaradhan
, Pavlos Nikolopoulos
, Christina Fragouli
, Suhas N. Diggavi
:
Improving Group Testing via Gradient Descent. 236-245 - Ezgi Özyilkan
, Johannes Ballé
, Elza Erkip
:
Neural Distributed Compressor Discovers Binning. 246-260 - Mark Beliaev
, Payam Delgosha
, Hamed Hassani
, Ramtin Pedarsani
:
Efficient and Robust Classification for Sparse Attacks. 261-272 - Gholamali Aminian
, Mohammad Saeed Masiha
, Laura Toni
, Miguel R. D. Rodrigues
:
Learning Algorithm Generalization Error Bounds via Auxiliary Distributions. 273-284 - Baturalp Buyukates
, Jinhyun So
, Hessam Mahdavifar
, Salman Avestimehr:
LightVeriFL: A Lightweight and Verifiable Secure Aggregation for Federated Learning. 285-301 - Banghua Zhu
, Ziao Wang
, Nadim Ghaddar
, Jiantao Jiao
, Lele Wang
:
Noisy Computing of the OR and MAX Functions. 302-313 - Giuseppe Serra
, Photios A. Stavrou
, Marios Kountouris
:
On the Computation of the Gaussian Rate-Distortion-Perception Function. 314-330 - Mohamed Seif, Yanxi Chen, Andrea J. Goldsmith, H. Vincent Poor:
Differentially Private Sketch-and-Solve for Community Detection via Semidefinite Programming. 331-346
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.