Every paper with a summary
Every arXiv paper Paperlayer has summarized so far. Open any of them to read the summary beside the original PDF, with every point linked to the line, figure, or table it came from.
Search paper metadata (including unsummarized papers)
25,021 to 25,080 of 119,510
ClutterDexGrasp: A Sim-to-Real System for General Dexterous Grasping in Cluttered Scenes
Zeyuan Chen, Qiyang Yan, Yuanpei Chen +6
cs.ROarXiv:2506.14317v32025What's in a Benchmark? The Case of SWE-Bench in Automated Program Repair
Matias Martinez, Xavier Franch
cs.SEarXiv:2602.04449v12026Coercing LLMs to do and reveal (almost) anything
Jonas Geiping, Alex Stein, Manli Shu +3
cs.LGcs.CLcs.CRarXiv:2402.14020v12024Ignore This Title and HackAPrompt: Exposing Systemic Vulnerabilities of LLMs through a Global Scale Prompt Hacking Competition
Sander Schulhoff, Jeremy Pinto, Anaum Khan +7
cs.CRcs.AIcs.CLarXiv:2311.16119v32023MOSSBench: Is Your Multimodal Language Model Oversensitive to Safe Queries?
Xirui Li, Hengguang Zhou, Ruochen Wang +3
cs.CLcs.AIcs.CRarXiv:2406.17806v12024Fault-Tolerant Renormalization Group Decoder for Abelian Topological Codes
Guillaume Duclos-Cianci, David Poulin
quant-pharXiv:1304.6100v12013Semantically-Aware Rewards for Open-Ended R1 Training in Free-Form Generation
Zongxia Li, Yapei Chang, Yuhang Zhou +4
cs.CLcs.LGarXiv:2506.15068v12025ETA: Evaluating Then Aligning Safety of Vision Language Models at Inference Time
Yi Ding, Bolian Li, Ruqi Zhang
cs.CVcs.CLcs.LGarXiv:2410.06625v22024Optimizing Safe and Aligned Language Generation: A Multi-Objective GRPO Approach
Xuying Li, Zhuo Li, Yuji Kosuga +1
cs.CLarXiv:2503.21819v12025Mercury: A Code Efficiency Benchmark for Code Large Language Models
Mingzhe Du, Anh Tuan Luu, Bin Ji +2
cs.SEcs.CLarXiv:2402.07844v42024SWR-Bench: Assessing LLM Performance in Real-World Code Review Comment Generation
Zhengran Zeng, Ruikai Shi, Keke Han +7
cs.SEarXiv:2509.01494v22025PEACE: Towards Efficient Project-Level Efficiency Optimization via Hybrid Code Editing
Xiaoxue Ren, Jun Wan, Yun Peng +5
cs.SEarXiv:2510.17142v22025AI-LieDar: Examine the Trade-off Between Utility and Truthfulness in LLM Agents
Zhe Su, Xuhui Zhou, Sanketh Rangreji +4
cs.AIcs.CLarXiv:2409.09013v22024Bayesian inference for logistic models using Polya-Gamma latent variables
Nicholas G. Polson, James G. Scott, Jesse Windle
stat.MEstat.COstat.MLarXiv:1205.0310v32012EffiCoder: Enhancing Code Generation in Large Language Models through Efficiency-Aware Fine-tuning
Dong Huang, Guangtao Zeng, Jianbo Dai +6
cs.CLcs.SEarXiv:2410.10209v42024CodeDPO: Aligning Code Models with Self Generated and Verified Source Code
Kechi Zhang, Ge Li, Yihong Dong +5
cs.SEarXiv:2410.05605v22024COFFE: A Code Efficiency Benchmark for Code Generation
Yun Peng, Jun Wan, Yichen Li +1
cs.SEarXiv:2502.02827v12025How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Ruizhong Qiu, Weiliang Will Zeng, James Ezick +2
cs.SEcs.AIcs.LGarXiv:2406.06647v42024Towards Better Correctness and Efficiency in Code Generation
Yunlong Feng, Yang Xu, Xiao Xu +2
cs.SEcs.AIarXiv:2508.20124v12025Nodal discontinuous Galerkin methods for non-ideal equations of state: pressure equilibrium preservation and entropy correction
Jesse CHan, Hendrik Ranocha, Raymond Park +3
math.NAcs.CEcs.NAarXiv:2608.14506v12026Pressure-equilibrium-preserving and fully conservative discretization of compressible flow equations for real and thermally perfect gases
Gennaro Coppola, Alessandro Aiello, Carlo De Michele
physics.flu-dyncs.NAmath.NAarXiv:2605.03617v22026Graphical algorithms and threshold error rates for the 2d colour code
D. S. Wang, A. G. Fowler, C. D. Hill +1
quant-pharXiv:0907.1708v12009State-constraint static Hamilton-Jacobi equations in nested domains
Yeoneung Kim, Hung V. Tran, Son N. T. Tu
math.AParXiv:1906.11222v22019Randomized Block Adaptive Linear System Solvers
Vivak Patel, Mohammad Jahangoshahi, Daniel Adrian Maldonado
math.NAcs.NAarXiv:2204.01653v22022Improved variants of the Hutch++ algorithm for trace estimation
David Persson, Alice Cortinovis, Daniel Kressner
math.NAcs.NAarXiv:2109.10659v32021Layer-switching cost and optimality in information spreading on multiplex networks
Byungjoon Min, Sang-Hwan Gwak, Nanoom Lee +1
physics.soc-phcond-mat.stat-mechcs.SIarXiv:1307.2967v22013Boson-Sampling in the light of sample complexity
C. Gogolin, M. Kliesch, L. Aolita +1
quant-phcs.CCarXiv:1306.3995v32013Optimal strategies for estimating the average fidelity of quantum gates
Daniel M. Reich, Giulia Gualdi, Christiane P. Koch
quant-pharXiv:1305.5649v22013Almost one bit violation for the additivity of the minimum output entropy
Serban T. Belinschi, Benoit Collins, Ion Nechita
math-phmath.MPmath.OAarXiv:1305.1567v32013Margins, Shrinkage, and Boosting
Matus Telgarsky
cs.LGstat.MLarXiv:1303.4172v12013Joint Modelling of Multiple Network Views
Isabella Gollini, Thomas Brendan Murphy
stat.MEstat.AParXiv:1301.3759v32013Cooperation Optimized Design for Information Dissemination in Vehicular Networks using Evolutionary Game Theory
Abhik Banerjee, Vincent Gauthier, Houda Labiod +1
cs.NIcs.GTarXiv:1301.1268v12013QMA-complete problems
Adam D. Bookatz
quant-pharXiv:1212.6312v32012The Greedy Miser: Learning under Test-time Budgets
Zhixiang Xu, Kilian Weinberger, Olivier Chapelle
cs.LGstat.MLarXiv:1206.6451v12012Exponential extinction time of the contact process on finite graphs
Thomas Mountford, Jean-Christophe Mourrat, Daniel Valesin +1
math.PRarXiv:1203.2972v12012Heralded state preparation in a superconducting qubit
J. E. Johnson, C. Macklin, D. H. Slichter +4
quant-phcond-mat.mes-hallcond-mat.supr-conarXiv:1202.5541v22012The Smooth Entropy Formalism for von Neumann Algebras
Mario Berta, Fabian Furrer, Volkher B. Scholz
quant-phmath-phmath.MParXiv:1107.5460v32011Universal Quantum Computation and Leakage Reduction in the 3-Qubit Decoherence Free Subsystem
Bryan H. Fong, Stephen M. Wandzura
quant-pharXiv:1102.2909v12011Adding a referee to an interconnection network: What can(not) be computed in one round
Florent Becker, Martín Matamala, Nicolas Nisse +3
cs.CCcs.DCarXiv:1009.4447v22010Compressive Sensing over Graphs
Weiyu Xu, Enrique Mallada, Ao Tang
cs.ITcs.NImath.ITarXiv:1008.0919v12010Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
Anupam Gupta, Viswanath Nagarajan, R. Ravi
cs.DSarXiv:1003.0722v32010A new Sobolev gradient method for direct minimization of the Gross-Pitaevskii energy with rotation
Ionut Danaila, Parimah Kazemi
cond-mat.quant-gascs.NAmath.NAarXiv:0911.3129v22009Gaussian Approximation Potentials: the accuracy of quantum mechanics, without the electrons
Albert P. Bartók, Mike C. Payne, Risi Kondor +1
physics.comp-phcond-mat.mtrl-sciarXiv:0910.1019v32009An Asymptotically Optimal Policy for Finite Support Models in the Multiarmed Bandit Problem
Junya Honda, Akimichi Takemura
math.STstat.THarXiv:0905.2776v32009Stochastic Depletion Problems: Effective Myopic Policies for a class of Dynamic Optimization Problems
Carri W. Chan, Vivek F. Farias
math.OCarXiv:0801.3695v12008Understanding Object Dynamics for Interactive Image-to-Video Synthesis
Andreas Blattmann, Timo Milbich, Michael Dorkenwald +1
cs.CVarXiv:2106.11303v12021Wav2vec-C: A Self-supervised Model for Speech Representation Learning
Samik Sadhu, Di He, Che-Wei Huang +6
eess.AScs.LGcs.SDarXiv:2103.08393v22021Completeness of the ZH-calculus
Miriam Backens, Aleks Kissinger, Hector Miller-Bakewell +2
quant-pharXiv:2103.06610v22021Local Differential Privacy Is Equivalent to Contraction of $E_\gamma$-Divergence
Shahab Asoodeh, Maryam Aliakbarpour, Flavio P. Calmon
cs.ITcs.LGmath.ITarXiv:2102.01258v12021Animating Pictures with Eulerian Motion Fields
Aleksander Holynski, Brian Curless, Steven M. Seitz +1
cs.CVcs.GRarXiv:2011.15128v12020EIGEN: Event Influence GENeration using Pre-trained Language Models
Aman Madaan, Dheeraj Rajagopal, Yiming Yang +3
cs.CLarXiv:2010.11764v12020Artificial Intelligence (AI)-Centric Management of Resources in Modern Distributed Computing Systems
Shashikant Ilager, Rajeev Muralidhar, Rajkumar Buyya
cs.DCcs.LGarXiv:2006.05075v22020The ZX&-calculus: A complete graphical calculus for classical circuits using spiders
Cole Comfort
cs.LOmath.CTquant-pharXiv:2004.05287v52020First Order Constrained Optimization in Policy Space
Yiming Zhang, Quan Vuong, Keith W. Ross
cs.LGcs.AIstat.MLarXiv:2002.06506v22020An Algebraic Axiomatisation of ZX-calculus
Quanlong Wang
quant-pharXiv:1911.06752v32019Intention Recognition of Pedestrians and Cyclists by 2D Pose Estimation
Zhijie Fang, Antonio M. López
cs.CVcs.ROarXiv:1910.03858v12019Bi-level Actor-Critic for Multi-agent Coordination
Haifeng Zhang, Weizhe Chen, Zeren Huang +4
cs.MAarXiv:1909.03510v32019Survey on Terahertz Nanocommunication and Networking: A Top-Down Perspective
Filip Lemic, Sergi Abadal, Wouter Tavernier +5
cs.NIcs.ETcs.SYarXiv:1909.05703v32019Are You Convinced? Choosing the More Convincing Evidence with a Siamese Network
Martin Gleize, Eyal Shnarch, Leshem Choshen +4
cs.LGcs.CLstat.MLarXiv:1907.08971v22019DynamoNet: Dynamic Action and Motion Network
Ali Diba, Vivek Sharma, Luc Van Gool +1
cs.CVarXiv:1904.11407v12019