We study online classification in the presence of noisy labels. The nois...
We present a rigorous and precise analysis of the maximum degree and the...
Many conventional learning algorithms rely on loss functions other than ...
We study the problem of online learning and online regret minimization w...
We study the problem of sequential prediction and online minimax regret ...
We study the sequential general online regression, known also as the
seq...
There has been significant recent interest in quantum neural networks (Q...
Over decades traditional information theory of source and channel coding...
We develop a framework using Hilbert spaces as a proxy to analyze PAC
le...
Advances in quantum information processing compel us to explore learning...
Theoretical results show that Bayesian methods can achieve lower bounds ...
We study the problem of estimating a rank-1 additive deformation of a
Ga...
Recovery a planted signal perturbed by noise is a fundamental problem in...
Sequential probability assignment and universal compression go hand in h...
We study here the so called subsequence pattern matching also known as h...
In temporal ordered clustering, given a single snapshot of a dynamic net...
Numerous networks in the real world change over time, in the sense that ...
String complexity is defined as the cardinality of a set of all distinct...
As an increasing amount of data is gathered nowadays and stored in datab...
The von Neumann entropy, named after John von Neumann, is the extension ...