all AI news
Nonsmooth Implicit Differentiation: Deterministic and Stochastic Convergence Rates
March 19, 2024, 4:43 a.m. | Riccardo Grazzi, Massimiliano Pontil, Saverio Salzo
cs.LG updates on arXiv.org arxiv.org
Abstract: We study the problem of efficiently computing the derivative of the fixed-point of a parametric non-differentiable contraction map. This problem has wide applications in machine learning, including hyperparameter optimization, meta-learning and data poisoning attacks. We analyze two popular approaches: iterative differentiation (ITD) and approximate implicit differentiation (AID). A key challenge behind the nonsmooth setting is that the chain rule does not hold anymore. Building upon the recent work by Bolte et al. (2022), who proved …
abstract analyze applications arxiv attacks computing convergence cs.lg data data poisoning differentiable differentiation fixed-point hyperparameter iterative machine machine learning map math.oc meta meta-learning optimization parametric poisoning attacks popular stat.ml stochastic study type
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Software Engineer for AI Training Data (School Specific)
@ G2i Inc | Remote
Software Engineer for AI Training Data (Python)
@ G2i Inc | Remote
Software Engineer for AI Training Data (Tier 2)
@ G2i Inc | Remote
Data Engineer
@ Lemon.io | Remote: Europe, LATAM, Canada, UK, Asia, Oceania
Artificial Intelligence – Bioinformatic Expert
@ University of Texas Medical Branch | Galveston, TX
Lead Developer (AI)
@ Cere Network | San Francisco, US