Showing papers from University of Copenhagen Show all papers
Paris Poster Session 4, Thu, Dec 10, 5:30 PM–7:30 PM, Paris Poster Hall · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1:00 PM, Hall 1-4 · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
Paris Poster Session 6, Fri, Dec 11, 2:30 PM–4:30 PM, Paris Poster Hall · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1:00 PM, Hall 1-4 · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
Monotone ReLU networks cannot compute or approximate maximum, ICNNs need depth n for it, and depth-k ICNNs cannot simulate some depth-2 ReLU networks.
Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1:00 PM, Hall 1-4 · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
Linear non-Gaussian cyclic models yield recoverable low-dimensional acyclic summaries representing observational equivalence classes, learnable in cubic time with sample complexity bounds.
Sydney Poster Session 2, Tue, Dec 8, 5:00 PM–8:00 PM, Hall 1-4 · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
Metropolis-adjusted Langevin correctors using score-based acceptance probabilities and a two-coin Bernoulli factory reduce diffusion model sampling bias and improve FID.
Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1:00 PM, Hall 1-4 · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
NBFFG uses a proxy linear-Gaussian backward filter and neural residual to guide inference in nonlinear continuous tree processes, reducing training cost to path-length dependence and outperforming baselines in phylogenetic reconstruction.
Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1:00 PM, Hall 1-4 · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
Three visual benchmarks for video understanding expose large video model weaknesses when reasoning through visual queries instead of text options.
Paris Poster Session 5, Fri, Dec 11, 11:30 AM–1:30 PM, Paris Poster Hall · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
StitchVM stitches pretrained pixel-space reward models onto frozen diffusion backbones to build accurate noisy-latent value functions for efficient diffusion alignment, accelerating DPS 3.2× and DiffusionNFT 2.3×.
Sydney Poster Session 3, Wed, Dec 9, 10:00 AM–1:00 PM, Hall 1-4 · Published 2026 · ▲ 10 on Hugging Face
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
Lumberjack improves differentially private random forests via heavy hitter pruning of deep trees, achieving state-of-the-art privacy-utility trade-offs.
Sydney Poster Session 4, Wed, Dec 9, 5:00 PM–8:00 PM, Hall 1-4 · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
In randomly ordered DAGs, relative counts increase monotonically along causal order, enabling recovery via sorting and yielding singular equivalence classes.
Paris Poster Session 5, Fri, Dec 11, 11:30 AM–1:30 PM, Paris Poster Hall · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
Discrete Laplace post-processing yields unbiased subexponential estimators and simulates Laplace and Staircase mechanisms, outperforming them for discrete data.
Paris Poster Session 2, Wed, Dec 9, 5:00 PM–7:00 PM, Paris Poster Hall · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.