no code implementations • 30 Mar 2022 • Sabyasachi Chatterjee, Subhajit Goswami
We consider the problem of estimating piecewise regular functions in an online setting, i. e., the data arrive sequentially and at any round our task is to predict the value of the true function at the next revealed point using the available data from past predictions.
no code implementations • 7 Jan 2022 • Anamitra Chaudhuri, Sabyasachi Chatterjee
The general framework is then applied to nonparametric regression methods such as Trend Filtering and Dyadic CART.
no code implementations • 26 Nov 2019 • Sabyasachi Chatterjee, Subhajit Goswami
We prove oracle inequalities for the finite sample risk of Dyadic CART and ORT which imply tight risk bounds for several function classes of interest.
no code implementations • 4 Feb 2019 • Sabyasachi Chatterjee, Subhajit Goswami
2D Total Variation Denoising (TVD) is a widely used technique for image denoising.
no code implementations • ICML 2018 • Matt Bonakdarpour, Sabyasachi Chatterjee, Rina Foygel Barber, John Lafferty
Two methods are proposed for high-dimensional shape-constrained regression and classification.
no code implementations • NeurIPS 2016 • Yuancheng Zhu, Sabyasachi Chatterjee, John Duchi, John Lafferty
The bounds are expressed in terms of a localized and computational analogue of the modulus of continuity that is central to statistical minimax analysis.