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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Omri Lev

dblp:190/7472 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
4since 2021 · last 2025
0000-0002-6884-4387ORCID · corroborated

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

Theory of computation · 2 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

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
2 papers
Coding theory · 57% Algorithms and data structures · 43%
Network and information security
1 paper
Privacy and data protection · 100%
Computer networks
1 paper
Physical-layer communications · 100%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection
differential privacy
0.912025
The Gaussian Mixing Mechanism: Renyi Differential Privacy via Gaussian Sketches · NeurIPS 2025
Privacy and data protection › differential privacy › relaxed differential privacy
rényi differential privacy
0.912025
The Gaussian Mixing Mechanism: Renyi Differential Privacy via Gaussian Sketches · NeurIPS 2025
Algorithms and data structures › numerical linear algebra
dimensionality reduction
0.912025
The Gaussian Mixing Mechanism: Renyi Differential Privacy via Gaussian Sketches · NeurIPS 2025
Coding theory
joint source-channel coding
0.612022
Energy-Limited Joint Source-Channel Coding via Analog Pulse Position Modulation · IEEE Trans. Commun. 2022
Coding theory › source coding
rate-distortion theory
0.612022
Energy-Limited Joint Source-Channel Coding via Analog Pulse Position Modulation · IEEE Trans. Commun. 2022
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
linear regression
0.312025
The Gaussian Mixing Mechanism: Renyi Differential Privacy via Gaussian Sketches · NeurIPS 2025
Physical-layer communications
modulation
0.212022
Energy-Limited Joint Source-Channel Coding via Analog Pulse Position Modulation · IEEE Trans. Commun. 2022
Physical-layer communications › modulation
pulse position modulation
0.212022
Energy-Limited Joint Source-Channel Coding via Analog Pulse Position Modulation · IEEE Trans. Commun. 2022

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

renyi divergence · 2.6gaussian sketching · 2.6numerical simulation · 1.1analytical bounds · 1.1
YearPublicationVenuePosition
2025 The Gaussian Mixing Mechanism: Renyi Differential Privacy via Gaussian Sketches
abstract
Gaussian sketching, which consists of pre-multiplying the data with a random Gaussian matrix, is a widely used technique in data science and machine learning. Beyond computational benefits, this operation also provides differential privacy guarantees due to its inherent randomness. In this work, we revisit this operation through the lens of \Renyi Differential Privacy (RDP), providing a refined privacy analysis that yields significantly tighter bounds than prior results. We then demonstrate how this improved analysis leads to performance improvement in different linear regression settings, establishing theoretical utility guarantees. Empirically, our methods improve performance across multiple datasets and, in several cases, reduce runtime.
Omri Lev, Vishwak Srinivasan, Moshe Shenfeld, Katrina Ligett, Ayush Sekhari, Ashia Wilson
NeurIPS1
2022 Universal Joint Source-Channel Coding Under an Input Energy Constraint
abstract
We consider the problem of transmitting a source over an infinite-bandwidth additive white Gaussian noise channel with unknown noise level under an input energy constraint. We construct a universal scheme that uses modulo-lattice modulation with multiple layers; for each layer, we employ either analog linear modulation or analog pulse position modulation (PPM). We show that the designed scheme with linear layers requires less energy than existing solutions to achieve the same quadratically increasing distortion profile with the noise level; replacing the linear layers with PPM layers offers an additional improvement.
Omri Lev, Anatoly Khina
ISIT1
2022 Energy-Limited Joint Source-Channel Coding via Analog Pulse Position Modulation
abstract
We study the problem of transmitting a source sample with minimum distortion over an infinite-bandwidth additive white Gaussian noise channel under an energy constraint. To that end, we construct a joint source–channel coding scheme using analog pulse position modulation (PPM) and bound its quadratic distortion. We show that this scheme outperforms existing techniques, since its quadratic distortion attains both the exponential and polynomial decay orders of Burnashev’s outer bound. We supplement our theoretical results with numerical simulations and comparison to existing schemes.
Omri Lev, Anatoly Khina
IEEE Trans. Commun.1
2021 Energy-limited Joint Source-Channel Coding via Analog Pulse Position Modulation
abstract
We study the problem of transmitting a source sample with minimum distortion over an infinite-bandwidth additive white Gaussian noise channel under an energy constraint. To that end, we construct a joint source–channel coding scheme using analog pulse position modulation (PPM) and bound its quadratic distortion. We show that this scheme outperforms existing techniques since its quadratic distortion attains both the exponential and polynomial decay orders of Burnashev’s outer bound.
Omri Lev, Anatoly Khina
ITW1
2020 Gauss-Markov Source Tracking with Side Information: Lower Bounds
Omri Lev, Anatoly Khina
ISITA1