mlsanityData to 7 Oct 2026

R-U-SURE? Uncertainty-Aware Code Suggestions By Maximizing Utility Across Random User Intents

arXiv 2303.00732 ↗First posted 1 Mar 2023cs.LG cs.SEcited by 10

Not on the map. Why?

Abstract (arXiv)

Large language models show impressive results at predicting structured text such as code, but also commonly introduce errors and hallucinations in their output. When used to assist software developers, these models may make mistakes that users must go back and fix, or worse, introduce subtle bugs that users may miss entirely. We propose Randomized Utility-driven Synthesis of Uncertain REgions (R-U-SURE), an approach for building uncertainty-aware suggestions based on a decision-theoretic model of goal-conditioned utility, using random samples from a generative model as a proxy for the unobserved possible intents of the end user. Our technique combines minimum-Bayes-risk decoding, dual decomposition, and decision diagrams in order to efficiently produce structured uncertainty summaries, given only sample access to an arbitrary generative model of code and an optional AST parser. We demonstrate R-U-SURE on three developer-assistance tasks, and show that it can be applied different user interaction patterns without retraining the model and leads to more accurate uncertainty estimates than token-probability baselines. We also release our implementation as an open-source library at https://github.com/google-research/r_u_sure.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 68 of its 108 references that are in the map. First posted on arXiv 1 Mar 2023.

Builds on

68 of 108 references.

References · 68

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2022Training language models to follow instructions with human feedbackcited by 15,712
  3. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  4. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,601
  5. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
  6. 2022Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedbackcited by 3,634
  7. 2021Program Synthesis with Large Language Modelscited by 3,509
  8. 2019The Curious Case of Neural Text Degenerationcited by 2,881
  9. 2019Fine-Tuning Language Models from Human Preferencescited by 2,124
  10. 2022Language Models (Mostly) Know What They Knowcited by 1,783
  11. 2022Competition-Level Code Generation with AlphaCodecited by 1,427
  12. 2020CodeBERT: A Pre-Trained Model for Programming and Natural Languagescited by 1,286
38 more
  1. 2020On Faithfulness and Factuality in Abstractive Summarizationcited by 895
  2. 2022CodeGen: An Open Large Language Model for Code with Multi-Turn Program Synthesiscited by 876
  3. 2017Selective Classification for Deep Neural Networkscited by 799
  4. 2021A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantificationcited by 777
  5. 2022Teaching Models to Express Their Uncertainty in Wordscited by 731
  6. 2022Large Language Models Can Self-Improvecited by 656
  7. 2022CodeRL: Mastering Code Generation through Pretrained Models and Deep Reinforcement Learningcited by 342
  8. 2020IntelliCode Compose: Code Generation Using Transformercited by 225
  9. 2022Grounded Copilot: How Programmers Interact with Code-Generating Modelscited by 216
  10. 2020DreamCoder: Growing generalizable, interpretable knowledge with wake-sleep Bayesian program learningcited by 159
  11. 2020Is MAP Decoding All You Need? The Inadequacy of the Mode in Neural Machine Translationcited by 137
  12. 2021A Token-level Reference-free Hallucination Detection Benchmark for Free-form Text Generationcited by 137
  13. 2018Analyzing Uncertainty in Neural Machine Translationcited by 126
  14. 2020The Language Interpretability Tool: Extensible, Interactive Visualizations and Analysis for NLP Modelscited by 125
  15. 2022Natural Language to Code Translation with Executioncited by 122
  16. 2021High Quality Rather than High Model Probability: Minimum Bayes Risk Decoding with Neural Metricscited by 104
  17. 2022Uncertainty Quantification with Pre-trained Language Models: A Large-Scale Empirical Analysiscited by 104
  18. 2022Plex: Towards Reliability using Pretrained Large Model Extensionscited by 102
  19. 2017Deeply AggreVaTeD: Differentiable Imitation Learning for Sequential Predictioncited by 93
  20. 2022Reading Between the Lines: Modeling User Behavior and Costs in AI-Assisted Programmingcited by 91
  21. 2022Coder Reviewer Reranking for Code Generationcited by 83
  22. 2016Stochastic Multiple Choice Learning for Training Diverse Deep Ensemblescited by 77
  23. 2019Deep Gamblers: Learning to Abstain with Portfolio Theorycited by 69
  24. 2017Minimum Word Error Rate Training for Attention-based Sequence-to-Sequence Modelscited by 68
  25. 2018Accurate and Diverse Sampling of Sequences based on a "Best of Many" Sample Objectivecited by 56
  26. 2021Understanding the Properties of Minimum Bayes Risk Decoding in Neural Machine Translationcited by 56
  27. 2021Machine Translation Decoding beyond Beam Searchcited by 55
  28. 2022Investigating Explainability of Generative AI for Code through Scenario-based Designcited by 47
  29. 2019Learning to Infer Program Sketchescited by 44
  30. 2020Energy-Based Reranking: Improving Neural Machine Translation Using Energy-Based Modelscited by 44
  31. 2021Perfection Not Required? Human-AI Partnerships in Code Translationcited by 42
  32. 2018Deep Reinforcement Learning For Sequence to Sequence Modelscited by 39
  33. 2019Program Synthesis and Semantic Parsing with Learned Code Idiomscited by 34
  34. 2018Confidence Modeling for Neural Semantic Parsingcited by 33
  35. 2021Learning to Complete Code with Sketchescited by 23
  36. 2017Neural Lattice-to-Sequence Models for Uncertain Inputscited by 20
  37. 2014Mining Idioms from Source Codecited by 19
  38. 2022The Calibration Generalization Gapcited by 18

50 most cited of 68 All 68 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 3; 2024: 1; 2025: 3; 2026: 3.

10 papers.