research
∙
09/04/2023
Robust Online Classification: From Estimation to Denoising
We study online classification in the presence of noisy labels. The nois...
share
research
∙
08/08/2023
On the concentration of the maximum degree in the duplication-divergence models
We present a rigorous and precise analysis of the maximum degree and the...
research
∙
03/08/2023
Agnostic PAC Learning of k-juntas Using L2-Polynomial Regression
Many conventional learning algorithms rely on loss functions other than ...
research
∙
01/31/2023
Online Learning in Dynamically Changing Environments
We study the problem of online learning and online regret minimization w...
research
∙
09/09/2022
Expected Worst Case Regret via Stochastic Sequential Covering
We study the problem of sequential prediction and online minimax regret ...
research
∙
05/07/2022
Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm
We study the sequential general online regression, known also as the seq...
research
∙
03/22/2022
Toward Physically Realizable Quantum Neural Networks
There has been significant recent interest in quantum neural networks (Q...
research
∙
07/13/2021
A Theoretical Framework for Learning from Quantum Data
Over decades traditional information theory of source and channel coding...
research
∙
02/11/2021
On Agnostic PAC Learning using â„’_2-polynomial Regression and Fourier-based Algorithms
We develop a framework using Hilbert spaces as a proxy to analyze PAC le...
research
∙
02/10/2021
A Low Degree Learning Algorithm for Quantum Data via Quantum Fourier
Advances in quantum information processing compel us to explore learning...
research
∙
01/28/2021
Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning
Theoretical results show that Bayesian methods can achieve lower bounds ...
research
∙
01/25/2021
On maximum-likelihood estimation in the all-or-nothing regime
We study the problem of estimating a rank-1 additive deformation of a Ga...
research
∙
11/23/2020
Statistical and computational thresholds for the planted k-densest sub-hypergraph problem
Recovery a planted signal perturbed by noise is a fundamental problem in...
research
∙
05/20/2020
Sequential Universal Modeling for Non-Binary Sequences with Constrained Distributions
Sequential probability assignment and universal compression go hand in h...
research
∙
03/21/2020
Hidden Words Statistics for Large Patterns
We study here the so called subsequence pattern matching also known as h...
research
∙
05/02/2019
Temporal Ordered Clustering in Dynamic Networks
In temporal ordered clustering, given a single snapshot of a dynamic net...
research
∙
04/06/2019
Goodness of Fit Testing for Dynamic Networks
Numerous networks in the real world change over time, in the sense that ...
research
∙
05/23/2018
Joint String Complexity for Markov Sources: Small Data Matters
String complexity is defined as the cardinality of a set of all distinct...
research
∙
03/09/2018
The Trade-off between Privacy and Fidelity via Ehrhart Theory
As an increasing amount of data is gathered nowadays and stored in datab...
research
∙
01/03/2018
