← Search

Aleksandra Korolova

9 accepted papers

2026

AutoCode: LLMs as Problem Setters for Competitive Programming

ICLR 2026poster

Writing competitive programming problems is exacting. Authors must: set constraints, input distributions, and edge cases that rule out shortcuts; target specific algorithms (e.g., max-flow, dynamic programming, data structures); and calibrate complexity beyond the reach of most competitors. We argue…

Cited by 0SourceScholar
2026

FrontierCS: Evolving Challenges for Evolving Intelligence

ICML 2026poster

We introduce FrontierCS, a benchmark of 240 open-ended problems across diverse areas of computer science, designed and reviewed by experts, including CS PhDs and top-tier competitive programming participants and problem setters. Unlike existing benchmarks that focus on tasks with known optimal solut…

Cited by 0SourceScholar
2026

Greedy Coordinate Diffusion: Effective and Semantically Coherent Adversarial Attacks via Diffusion Guidance

ICML 2026poster

Although there is a rich literature on adversarial attacks on large language models, their current practical impact is limited. Gradient-based attacks such as Greedy Coordinate Gradient (Zou et al., 2023) typically produce high-perplexity, incoherent suffixes that are easily detectable and thus easy…

Cited by 0SourceScholar
2025

LiveCodeBench Pro: How Do Olympiad Medalists Judge LLMs in Competitive Programming?

NeurIPS 2025poster

Recent reports claim that large language models (LLMs) now outperform elite humans in competitive programming. Drawing on knowledge from a group of medalists in international algorithmic contests, we revisit this claim, examining how LLMs differ from human experts and where limitations still remain.…

Cited by 0SourceScholar
2025

ReliabilityRAG: Effective and Provably Robust Defense for RAG-based Web-Search

NeurIPS 2025poster

Retrieval-Augmented Generation (RAG) enhances Large Language Models by grounding their outputs in external documents. These systems, however, remain vulnerable to attacks on the retrieval corpus, such as prompt injection. RAG-based search systems (e.g., Google’s Search AI Overview) present an intere…

Cited by 0SourceScholar
2024

Stability and Multigroup Fairness in Ranking with Uncertain Predictions

ICML 2024poster

Rankings are ubiquitous across many applications, from search engines to hiring committees. In practice, many rankings are derived from the output of predictors. However, when predictors trained for classification tasks have intrinsic uncertainty, it is not obvious how this uncertainty should be rep…

Cited by 4SourcePDFScholar
2021

Robust Allocations with Diversity Constraints

NeurIPS 2021poster

We consider the problem of allocating divisible items among multiple agents, and consider the setting where any agent is allowed to introduce {\emph diversity constraints} on the items they are allocated. We motivate this via settings where the items themselves correspond to user ad slots or task wo…

Cited by 2SourcePDFScholar