Nir Weinberger

Orcid: 0000-0001-6028-8892

According to our database1, Nir Weinberger authored at least 50 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A representation-learning game for classes of prediction tasks.
CoRR, 2024

Statistical curriculum learning: An elimination algorithm achieving an oracle risk.
CoRR, 2024

Characterization of the Distortion-Perception Tradeoff for Finite Channels with Arbitrary Metrics.
CoRR, 2024

The Joint Effect of Task Similarity and Overparameterization on Catastrophic Forgetting - An Analytical Model.
CoRR, 2024

2023
Multi-Armed Bandits With Self-Information Rewards.
IEEE Trans. Inf. Theory, November, 2023

Design of optimal labeling patterns for optical genome mapping via information theory.
Bioinform., October, 2023

Learning Maximum Margin Channel Decoders.
IEEE Trans. Inf. Theory, June, 2023

M-DAB: An Input-Distribution Optimization Algorithm for Composite DNA Storage by the Multinomial Channel.
CoRR, 2023

Quantifying the Loss of Acyclic Join Dependencies.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

How do Minimum-Norm Shallow Denoisers Look in Function Space?
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Fundamental Limits of Reference-Based Sequence Reordering.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Maximal-Capacity Discrete Memoryless Channel Identification.
Proceedings of the IEEE International Symposium on Information Theory, 2023

On Mismatched Oblivious Relaying.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Robust Linear Regression for General Feature Distribution.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
The DNA Storage Channel: Capacity and Error Probability Bounds.
IEEE Trans. Inf. Theory, 2022

Error Probability Bounds for Coded-Index DNA Storage Systems.
IEEE Trans. Inf. Theory, 2022

Generalization Bounds and Algorithms for Learning to Communicate Over Additive Noise Channels.
IEEE Trans. Inf. Theory, 2022

The EM Algorithm is Adaptively-Optimal for Unbalanced Symmetric Gaussian Mixtures.
J. Mach. Learn. Res., 2022

Error Probability Bounds for Coded-Index DNA Storage.
CoRR, 2022

The Compound Information Bottleneck Outlook.
CoRR, 2022

Mean Estimation in High-Dimensional Binary Markov Gaussian Mixture Models.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

On Information Bottleneck for Gaussian Processes.
Proceedings of the IEEE Information Theory Workshop, 2022

Upper Confidence Interval Strategies for Multi-Armed Bandits with Entropy Rewards.
Proceedings of the IEEE International Symposium on Information Theory, 2022

On Information-Theoretic Determination of Misspecified Rates of Convergence.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Learning Maximum Margin Channel Decoders for Non-linear Gaussian Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2022

The Compound Information Bottleneck Program.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
The DNA Storage Channel: Capacity and Error Probability.
CoRR, 2021

2020
k-Vectors: An Alternating Minimization Algorithm for Learning Regression Functions.
IEEE Trans. Inf. Theory, 2020

Large Deviations Behavior of the Logarithmic Error Probability of Random Codes.
IEEE Trans. Inf. Theory, 2020

Guessing with a Bit of Help.
Entropy, 2020

Learning Additive Noise Channels: Generalization Bounds and Algorithms.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
On the Reliability Function of Distributed Hypothesis Testing Under Optimal Detection.
IEEE Trans. Inf. Theory, 2019

Expurgated Bounds for the Asymmetric Broadcast Channel.
IEEE Trans. Inf. Theory, 2019

Self-Predicting Boolean Functions.
SIAM J. Discret. Math., 2019

Exponent Trade-off for Hypothesis Testing Over Noisy Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
On the VC-Dimension of Binary Codes.
SIAM J. Discret. Math., 2018

Guessing with a Boolean Helper.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
On the Optimal Boolean Function for Prediction Under Quadratic Loss.
IEEE Trans. Inf. Theory, 2017

Channel Detection in Coded Communication.
IEEE Trans. Inf. Theory, 2017

Simplified Erasure/List Decoding.
IEEE Trans. Inf. Theory, 2017

Lower Bounds on Parameter Modulation-Estimation Under Bandwidth Constraints.
IEEE Trans. Inf. Theory, 2017

A Large Deviations Approach to Secure Lossy Compression.
IEEE Trans. Inf. Theory, 2017

2016
Erasure/List Random Coding Error Exponents Are Not Universally Achievable.
IEEE Trans. Inf. Theory, 2016

2015
Optimum Tradeoffs Between the Error Exponent and the Excess-Rate Exponent of Variable-Rate Slepian-Wolf Coding.
IEEE Trans. Inf. Theory, 2015

Optimum trade-offs between error exponent and excess-rate exponent of Slepian-Wolf coding.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Codeword or Noise? Exact Random Coding Exponents for Joint Detection and Decoding.
IEEE Trans. Inf. Theory, 2014

Codeword or noise? Exact random coding exponents for slotted asynchronism.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Large deviations analysis of variable-rate Slepian-Wolf coding.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2011
Universal decoding over Gaussian fading channels - metric calculation and performance evaluation.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2008
Universal decoding for linear Gaussian fading channels in the competitive minimax sense.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008


  Loading...