Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Julia B. Nakhleh

dblp:276/0600 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Learning theory · 37% Deep learning architectures and training · 27% Trustworthy machine learning · 21%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
neural network theory
1.022025
A New Neural Kernel Regime: The Inductive Bias of Multi-Task Learning · NeurIPS 2024
Global Minimizers of ℓp-Regularized Objectives Yield the Sparsest ReLU Neural Networks · NeurIPS 2025
Mathematical optimization
regularization
0.912025
Global Minimizers of ℓp-Regularized Objectives Yield the Sparsest ReLU Neural Networks · NeurIPS 2025
Machine learning › Learning theory › neural network theory
kernel regime
0.812024
A New Neural Kernel Regime: The Inductive Bias of Multi-Task Learning · NeurIPS 2024
Machine learning › Learning paradigms
multi-task learning
0.812024
A New Neural Kernel Regime: The Inductive Bias of Multi-Task Learning · NeurIPS 2024
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection
0.612022
Training OOD Detectors in their Natural Habitats · ICML 2022
Machine learning › Trustworthy machine learning
robustness
0.612022
Training OOD Detectors in their Natural Habitats · ICML 2022
Machine learning › Learning theory
inductive bias
0.212024
A New Neural Kernel Regime: The Inductive Bias of Multi-Task Learning · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

ReLU networks · 1.7ℓp regularization · 0.9lp regularization · 0.9sobolev hilbert space · 0.8minimum-norm interpolation · 0.8kernel regression · 0.8wild mixture data · 0.6constrained optimization · 0.6auxiliary outlier data · 0.6
YearPublicationVenuePosition
2025 Global Minimizers of ℓp-Regularized Objectives Yield the Sparsest ReLU Neural Networks
Julia B. Nakhleh, Robert D. Nowak
NeurIPS1
2024 A New Neural Kernel Regime: The Inductive Bias of Multi-Task Learning
abstract
This paper studies the properties of solutions to multi-task shallow ReLU neural network learning problems, wherein the network is trained to fit a dataset with minimal sum of squared weights. Remarkably, the solutions learned for each individual task resemble those obtained by solving a kernel regression problem, revealing a novel connection between neural networks and kernel methods. It is known that single-task neural network learning problems are equivalent to a minimum norm interpolation problem in a non-Hilbertian Banach space, and that the solutions of such problems are generally non-unique. In contrast, we prove that the solutions to univariate-input, multi-task neural network interpolation problems are almost always unique, and coincide with the solution to a minimum-norm interpolation problem in a Sobolev (Reproducing Kernel) Hilbert Space. We also demonstrate a similar phenomenon in the multivariate-input case; specifically, we show that neural network learning problems with large numbers of tasks are approximately equivalent to an $\ell^2$ (Hilbert space) minimization problem over a fixed kernel determined by the optimal neurons.
Julia B. Nakhleh, Joseph Shenouda, Robert D. Nowak
NeurIPS1
2022 Training OOD Detectors in their Natural Habitats
abstract
Out-of-distribution (OOD) detection is important for machine learning models deployed in the wild. Recent methods use auxiliary outlier data to regularize the model for improved OOD detection. However, these approaches make a strong distributional assumption that the auxiliary outlier data is completely separable from the in-distribution (ID) data. In this paper, we propose a novel framework that leverages wild mixture data—that naturally consists of both ID and OOD samples. Such wild data is abundant and arises freely upon deploying a machine learning classifier in their natural habitats. Our key idea is to formulate a constrained optimization problem and to show how to tractably solve it. Our learning objective maximizes the OOD detection rate, subject to constraints on the classification error of ID data and on the OOD error rate of ID examples. We extensively evaluate our approach on common OOD detection tasks and demonstrate superior performance. Code is available at https://github.com/jkatzsam/woods_ood.
Julian Katz-Samuels, Julia B. Nakhleh, Robert D. Nowak, Yixuan Li 0001
ICML2