Search Results for author:
Found 3 papers, 0 papers with code
Nonstochastic Bandits with Infinitely Many Experts
We prove a high-probability upper bound of $\tilde{\mathcal{O}} \big( i^*K + \sqrt{KT} \big)$ on the regret, up to polylog factors, where $i^*$ is the unknown position of the best expert, $K$ is the number of actions, and $T$ is the time horizon.
Learning nonlinear dynamical systems from a single trajectory
We introduce algorithms for learning nonlinear dynamical systems of the form $x_{t+1}=\sigma(\Theta^{\star}x_t)+\varepsilon_t$, where $\Theta^{\star}$ is a weight matrix, $\sigma$ is a nonlinear link function, and $\varepsilon_t$ is a mean-zero noise process.
Lossy Compression via Sparse Linear Regression: Computationally Efficient Encoding and Decoding
The proposed encoding algorithm sequentially chooses columns of the design matrix to successively approximate the source sequence.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
