Demo Data from VLDB 2026 / reviewers in the wild / expert
Natalie Mackraz
dblp:359/5984
· DBLP profile ↗
3ranked-venue papers
0as 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 · 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 |
Language models and text generation · 47% Trustworthy machine learning · 34% Robot navigation and mapping · 10% |
Topics — the 8 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
alignment |
0.9 | 1 | 2025 | Aligning LLMs by Predicting Preferences from User Writing Samples · ICML 2025 |
Machine learning › Trustworthy machine learning
fairness |
0.9 | 1 | 2025 | Is Your Model Fairly Certain? Uncertainty-Aware Fairness Evaluation for LLMs · ICML 2025 |
Machine learning › Trustworthy machine learning › fairness
fairness evaluation |
0.9 | 1 | 2025 | Is Your Model Fairly Certain? Uncertainty-Aware Fairness Evaluation for LLMs · ICML 2025 |
Natural language and speech › Language models and text generation
large language model evaluation |
0.9 | 1 | 2025 | Is Your Model Fairly Certain? Uncertainty-Aware Fairness Evaluation for LLMs · ICML 2025 |
Natural language and speech › Language models and text generation › large language model › large language model adaptation
personalization |
0.9 | 1 | 2025 | Aligning LLMs by Predicting Preferences from User Writing Samples · ICML 2025 |
Machine learning › Trustworthy machine learning
uncertainty estimation |
0.9 | 1 | 2025 | Is Your Model Fairly Certain? Uncertainty-Aware Fairness Evaluation for LLMs · ICML 2025 |
Machine learning › Reinforcement learning › goal-conditioned reinforcement learning
language-conditioned reinforcement learning |
0.8 | 1 | 2024 | Large Language Models as Generalizable Policies for Embodied Tasks · ICLR 2024 |
Natural language and speech › Language models and text generation
in-context learning |
0.3 | 1 | 2025 | Aligning LLMs by Predicting Preferences from User Writing Samples · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
uncertainty calibration · 0.9preference verification · 0.9iterative refinement · 0.9in-context learning · 0.9equalized odds · 0.9reinforcement learning · 0.8large language model · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Aligning LLMs by Predicting Preferences from User Writing SamplesabstractAccommodating human preferences is essential for creating aligned LLM agents that deliver personalized and effective interactions. Recent work has shown the potential for LLMs acting as writing agents to infer a description of user preferences. Agent alignment then comes from conditioning on the inferred preference description. However, existing methods often produce generic preference descriptions that fail to capture the unique and individualized nature of human preferences. This paper introduces PROSE, a method designed to enhance the precision of preference descriptions inferred from user writing samples. PROSE incorporates two key elements: (1) iterative refinement of inferred preferences, and (2) verification of inferred preferences across multiple user writing samples. We evaluate PROSE with several LLMs (i.e., Qwen2.5 7B and 72B Instruct, GPT-mini, and GPT-4o) on a summarization and an email writing task. We find that PROSE more accurately infers nuanced human preferences, improving the quality of the writing agent’s generations over CIPHER (a state-of-the-art method for inferring preferences) by 33%. Lastly, we demonstrate that ICL and PROSE are complementary methods, and combining them provides up to a 9% improvement over ICL alone. Code: https://github.com/apple/ml-predict Stephane Aroca-Ouellette, Natalie Mackraz, Barry-John Theobald, Katherine Metcalf |
ICML | 2 |
| 2025 | Is Your Model Fairly Certain? Uncertainty-Aware Fairness Evaluation for LLMsabstractThe recent rapid adoption of large language models (LLMs) highlights the critical need for benchmarking their fairness. Conventional fairness metrics, which focus on discrete accuracy-based evaluations (i.e., prediction correctness), fail to capture the implicit impact of model uncertainty (e.g., higher model confidence about one group over another despite similar accuracy). To address this limitation, we propose an uncertainty-aware fairness metric, UCerf, to enable a fine-grained evaluation of model fairness that is more reflective of the internal bias in model decisions. Furthermore, observing data size, diversity, and clarity issues in current datasets, we introduce a new gender-occupation fairness evaluation dataset with 31,756 samples for co-reference resolution, offering a more diverse and suitable benchmark for modern LLMs. Combining our metric and dataset, we provide insightful comparisons of eight open-source LLMs. For example, Mistral-8B exhibits suboptimal fairness due to high confidence in incorrect predictions, a detail overlooked by Equalized Odds but captured by UCerF. Overall, this work provides a holistic framework for LLM evaluation by jointly assessing fairness and uncertainty, enabling the development of more transparent and accountable AI systems. Yinong Wang 0001, Nivedha Sivakumar, Falaah Arif Khan, Katherine Metcalf, Adam Golinski, Natalie Mackraz, Barry-John Theobald, Luca Zappella, Nicholas Apostoloff |
ICML | 6 |
| 2024 | Large Language Models as Generalizable Policies for Embodied TasksabstractWe show that large language models (LLMs) can be adapted to be generalizable policies for embodied visual tasks. Our approach, called Large LAnguage model Reinforcement Learning Policy (LLaRP), adapts a pre-trained frozen LLM to take as input text instructions and visual egocentric observations and output actions directly in the environment. Using reinforcement learning, we train LLaRP to see and act solely through environmental interactions. We show that LLaRP is robust to complex paraphrasings of task instructions and can generalize to new tasks that require novel optimal behavior. In particular, on 1,000 unseen tasks it achieves 42% success rate, 1.7x the success rate of other common learned baselines or zero-shot applications of LLMs. Finally, to aid the community in studying language conditioned, massively multi-task, embodied AI problems we release a novel benchmark, Language Rearrangement, consisting of 150,000 training and 1,000 testing tasks for language-conditioned rearrangement. Andrew Szot, Max Schwarzer, Harsh Agrawal, Bogdan Mazoure, Rin Metcalf Susa, Walter Talbott, Natalie Mackraz, R. Devon Hjelm, Alexander Toshev |
ICLR | 7 |