← Search

Yuriy Brun

6 accepted papers

2026

Memory Savings at What Cost? A Study of Alternatives to Backpropagation

ICML 2026poster

Forward-mode automatic differentiation (FmAD) and zero-order (ZO) optimization are increasingly proposed as memory-efficient, backpropagation-free alternatives for large language model (LLM) fine-tuning, yet their benefits are typically evaluated only against standard backpropagation (BP), omitting …

Cited by 0SourceScholar
2025

Beyond Prediction: Managing the Repercussions of Machine Learning Applications

NeurIPS 2025poster

Machine learning models are often designed to maximize a primary goal, such as accuracy. However, as these models are increasingly used to inform decisions that affect people's lives or well-being, it is often unclear what the real-world repercussions of their deployment might be—making it crucial t…

Cited by 0SourceScholar
2024

Attack-Resilient Image Watermarking Using Stable Diffusion

NeurIPS 2024poster

Watermarking images is critical for tracking image provenance and proving ownership. With the advent of generative models, such as stable diffusion, that can create fake but realistic images, watermarking has become particularly important to make human-created images reliably identifiable. Unfortuna…

2024

Thinking Forward: Memory-Efficient Federated Finetuning of Language Models

NeurIPS 2024poster

Finetuning large language models (LLMs) in federated learning (FL) settings has become increasingly important as it allows resource-constrained devices to finetune a model using private data. However, finetuning LLMs using backpropagation requires excessive memory (especially from intermediate activ…

2022

Fairness Guarantees under Demographic Shift

ICLR 2022poster

Recent studies have demonstrated that using machine learning for social applications can lead to injustice in the form of racist, sexist, and otherwise unfair and discriminatory outcomes. To address this challenge, recent machine learning algorithms have been designed to limit the likelihood such un…

Cited by 64SourcePDFScholar
2019

Offline Contextual Bandits with High Probability Fairness Guarantees

NeurIPS 2019poster

We present RobinHood, an offline contextual bandit algorithm designed to satisfy a broad family of fairness constraints. Our algorithm accepts multiple fairness definitions and allows users to construct their own unique fairness definitions for the problem at hand. We provide a theoretical analysis of…