Zobrazeno 1 - 10
of 866
pro vyhledávání: '"P. Cesa"'
Autor:
Bressan, Marco, Brukhim, Nataly, Cesa-Bianchi, Nicolò, Esposito, Emmanuel, Mansour, Yishay, Moran, Shay, Thiessen, Maximilian
Cost-sensitive loss functions are crucial in many real-world prediction problems, where different types of errors are penalized differently; for example, in medical diagnosis, a false negative prediction can lead to worse consequences than a false po
Externí odkaz:
http://arxiv.org/abs/2412.08012
Motivated by practical federated learning settings where clients may not be always available, we investigate a variant of distributed online optimization where agents are active with a known probability $p$ at each time step, and communication betwee
Externí odkaz:
http://arxiv.org/abs/2411.16477
We consider a sequential decision-making setting where, at every round $t$, a market maker posts a bid price $B_t$ and an ask price $A_t$ to an incoming trader (the taker) with a private valuation for one unit of some asset. If the trader's valuation
Externí odkaz:
http://arxiv.org/abs/2411.13993
On the Sample Complexity of One Hidden Layer Networks with Equivariance, Locality and Weight Sharing
Autor:
Behboodi, Arash, Cesa, Gabriele
Weight sharing, equivariance, and local filters, as in convolutional neural networks, are believed to contribute to the sample efficiency of neural networks. However, it is not clear how each one of these design choices contribute to the generalizati
Externí odkaz:
http://arxiv.org/abs/2411.14288
Autor:
Inal, Berfin, Cesa, Gabriele
Steerable networks, which process data with intrinsic symmetries, often use Fourier-based nonlinearities that require sampling from the entire group, leading to a need for discretization in continuous groups. As the number of samples increases, both
Externí odkaz:
http://arxiv.org/abs/2409.08741
In this research note, we revisit the bandits with expert advice problem. Under a restricted feedback model, we prove a lower bound of order $\sqrt{K T \ln(N/K)}$ for the worst-case regret, where $K$ is the number of actions, $N>K$ the number of expe
Externí odkaz:
http://arxiv.org/abs/2406.16802
Autor:
Bressan, Marco, Cesa-Bianchi, Nicolò, Esposito, Emmanuel, Mansour, Yishay, Moran, Shay, Thiessen, Maximilian
Can a deep neural network be approximated by a small decision tree based on simple features? This question and its variants are behind the growing demand for machine learning models that are *interpretable* by humans. In this work we study such quest
Externí odkaz:
http://arxiv.org/abs/2406.10529
Autor:
Veefkind, Lars, Cesa, Gabriele
Steerable convolutional neural networks (SCNNs) enhance task performance by modelling geometric symmetries through equivariance constraints on weights. Yet, unknown or varying symmetries can lead to overconstrained weights and decreased performance.
Externí odkaz:
http://arxiv.org/abs/2406.03946
We study stochastic linear bandits where, in each round, the learner receives a set of actions (i.e., feature vectors), from which it chooses an element and obtains a stochastic reward. The expected reward is a fixed but unknown linear function of th
Externí odkaz:
http://arxiv.org/abs/2406.01192
Autor:
de Ruijter, Larissa, Cesa, Gabriele
Cryo-EM is a vital technique for determining 3D structure of biological molecules such as proteins and viruses. The cryo-EM reconstruction problem is challenging due to the high noise levels, the missing poses of particles, and the computational dema
Externí odkaz:
http://arxiv.org/abs/2406.01630