Search Results for author:
Found 9 papers, 0 papers with code
A Huber Loss Minimization Approach to Byzantine Robust Federated Learning
Federated learning systems are susceptible to adversarial attacks.
Minimax Optimal $Q$ Learning with Nearest Neighbors
A modification of the original $Q$ learning method was proposed in (Shah and Xie, 2018), which estimates $Q$ values with nearest neighbors.
High Dimensional Distributed Gradient Descent with Arbitrary Number of Byzantine Attackers
In this paper, we design a new method that is suitable for high dimensional problems, under arbitrary number of Byzantine attackers.
Robust Nonparametric Regression under Poisoning Attack
The final estimate is nearly minimax optimal for arbitrary $q$, up to a $\ln N$ factor.
Optimal Stochastic Nonconvex Optimization with Bandit Feedback
In this paper, we analyze the continuous armed bandit problems for nonconvex cost functions under certain smoothness and sublevel set assumptions.
Analysis of KNN Density Estimation
We show that kNN density estimation is minimax optimal under both $\ell_1$ and $\ell_\infty$ criteria, if the support set is known.
Minimax Optimal Estimation of KL Divergence for Continuous Distributions
Estimating Kullback-Leibler divergence from identical and independently distributed samples is an important problem in various domains.
Minimax Rate Optimal Adaptive Nearest Neighbor Classification and Regression
For both classification and regression problems, existing works have shown that, if the distribution of the feature vector has bounded support and the probability density function is bounded away from zero in its support, the convergence rate of the standard kNN method, in which k is the same for all test samples, is minimax optimal.
Analysis of KNN Information Estimators for Smooth Distributions
Existing work has analyzed the convergence rate of this estimator for random variables whose densities are bounded away from zero in its support.
