Ambrus Tamás

According to our database, Ambrus Tamás authored at least 8 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits.

Ambrus Tamás, Szabolcs Szentpéteri, Balázs Csanád Csáji

CoRR, 2024

Data-Driven Confidence Intervals with Optimal Rates for the Mean of Heavy-Tailed Distributions.

Ambrus Tamás, Szabolcs Szentpéteri, Balázs Csanád Csáji

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

Robust Independence Tests With Finite Sample Guarantees for Synchronous Stochastic Linear Systems.

Ambrus Tamás, Dániel Ágoston Bálint, Balázs Csanád Csáji

IEEE Control. Syst. Lett., 2023

On rate-optimal classification from non-private and from private data.

Balázs Csanád Csáji, László Györfi, Ambrus Tamás

CoRR, 2023

Distribution-Free Inference for the Regression Function of Binary Classification.

Ambrus Tamás, Balázs Csanád Csáji

CoRR, 2023

Recursive Estimation of Conditional Kernel Mean Embeddings.

Ambrus Tamás, Balázs Csanád Csáji

CoRR, 2023

2022

Exact Distribution-Free Hypothesis Tests for the Regression Function of Binary Classification via Conditional Kernel Mean Embeddings.

Ambrus Tamás, Balázs Csanád Csáji

IEEE Control. Syst. Lett., 2022

2019

Semi-Parametric Uncertainty Bounds for Binary Classification.

Balázs Csanád Csáji, Ambrus Tamás

Proceedings of the 58th IEEE Conference on Decision and Control, 2019