Goto

Collaborating Authors

 Country


SteerConf: Steering LLMs for Confidence Elicitation

Neural Information Processing Systems

Large Language Models (LLMs) exhibit impressive performance across diverse domains but often suffer from overconfidence, limiting their reliability in critical applications. We propose SteerConf, a novel framework that systematically steers LLMs' confidence scores to improve their calibration and reliability. SteerConf introduces three key components: (1) a steering prompt strategy that guides LLMs to produce confidence scores in specified directions (e.g., conservative or optimistic) by leveraging prompts with varying steering levels; (2) a steered confidence consistency measure that quantifies alignment across multiple steered confidences to enhance calibration; and (3) a steered confidence calibration method that aggregates confidence scores using consistency measures and applies linear quantization for answer selection. SteerConf operates without additional training or fine-tuning, making it broadly applicable to existing LLMs. Experiments on seven benchmarks spanning professional knowledge, common sense, ethics, and reasoning tasks, using advanced LLM models (GPT-3.5, LLaMA 3, GPT-4), demonstrate that SteerConf significantly outperforms existing methods, often by a significant margin. Our findings highlight the potential of steering the confidence of LLMs to enhance their reliability for safer deployment in real-world applications.


Entangled robotic matter with cohesive motion

Robohub

Cornell engineers have developed a robotic collective that behaves less like a machine and more like a material that flows, reshapes and adapts to its environment without centralized control. The system, called the Cross-Link Collective, consists of dozens of small robots that have limited mobility individually, but together exhibit coordinated and sustained motion. The research, published May 20 in Science Robotics, demonstrates a robotic system that resembles soft matter, continuously deforming and reorganizing as it moves, driven by what researchers call mechanical intelligence. "Instead of relying on explicit computation and communication, the system shifts the intelligence into the shape of the robots and their physical interactions," said corresponding author Kirstin Petersen, associate professor of electrical and computer engineering and the Aref and Manon Lahham Faculty Fellow in the Cornell Duffield College of Engineering. "We're leveraging the contact dynamics to let useful behaviors emerge, so the system naturally settles into configurations that reduce internal stresses and improve motion."


Mamba Modulation On the Length Generalization of Mamba

Neural Information Processing Systems

The quadratic complexity of the attention mechanism in Transformer models has motivated the development of alternative architectures with sub-quadratic scaling, such as state-space models. Among these, Mamba has emerged as a leading architecture, achieving state-of-the-art results across a range of language modeling tasks. However, Mambas performance significantly deteriorates when applied to contexts longer than those seen during pre-training, revealing a sharp sensitivity to context length extension. Through detailed analysis, we attribute this limitation to the out-of-distribution behavior of its state-space dynamics, particularly within the parameterization of the state transition matrix A. Unlike recent works which attribute this sensitivity to the vanished accumulation of discretization time steps, exp( PN t=1 t), we establish a connection between state convergence behavior as the input length approaches infinity and the spectrum of the transition matrix A, offering a well-founded explanation of its role in length extension. Next, to overcome this challenge, we propose an approach that applies spectrum scaling to pre-trained Mamba models to enable robust long-context generalization by selectively modulating the spectrum of Amatrices in each layer. We show that this can significantly improve performance in settings where simply modulating t fails, validating our insights and providing avenues for better length generalization of state-space models with structured transition matrices.


1bf3dbbd6346f50627e2ab1795f90435-Paper-Conference.pdf

Neural Information Processing Systems

Diffusion Transformers have emerged as the foundation for vision generative models, but their scalability is limited by the high cost of hyperparameter (HP) tuning at large scales. Recently, Maximal Update Parametrization (ยตP) was proposed for vanilla Transformers, which enables stable HP transfer from small to large language models, and dramatically reduces tuning costs. However, it remains unclear whether ยตP of vanilla Transformers extends to diffusion Transformers, which differ architecturally and objectively. In this work, we generalize standard ยตP to diffusion Transformers and validate its effectiveness through large-scale experiments. First, we rigorously prove that ยตP of mainstream diffusion Transformers, including DiT, U-ViT, PixArt-ฮฑ, and MMDiT, aligns with that of the vanilla Transformer, enabling the direct application of existing ยตP methodologies. Leveraging this result, we systematically demonstrate that DiT-ยตP enjoys robust HP transferability. Notably, DiT-XL-2-ยตP with transferred learning rate achieves 2.9 faster convergence than the original DiT-XL-2.


This startup was supposed to revolutionize California's wine industry: 'It totally failed'

Los Angeles Times

Things to Do in L.A. Tap to enable a layout that focuses on the article. This startup was supposed to revolutionize California's wine industry: 'It totally failed' Nilay Patel, left, interviews Monarch Tractor Chief Executive Praveen Penmetsa during Vox Media's 2023 Code Conference in Dana Point, Calif., in 2023. That year, Monarch was on a Forbes list of startups most likely to reach a $1-billion valuation. This is read by an automated voice. Please report any issues or inconsistencies here .


A Crypto Scam Targeted a Gay OnlyFans Star. Then His X Feed Was Flooded With 'MAGA Propaganda'

WIRED

Then His X Feed Was Flooded With'MAGA Propaganda' In recent months hackers have attempted to extort money from porn stars with big followings, in some cases filling their feeds with pro-MAGA and crypto content. Patrick Bewley's X feed was normally filled with posts about leather three-ways and clips of poolhouse erotica . The gay OnlyFans star, known as Daddy Patrick, had decided to get into the adult industry at age 60 and in under two years his followers on X swelled to 132,000. But in April, his feed suddenly became very political --and very MAGA--with posts like " President Trump stuns the World announcing America has more oil than the next two largest Oil economies COMBINED." His account had been hacked.


ReinAD: Towards Real-world Industrial Anomaly Detection with a Comprehensive Contrastive Dataset

Neural Information Processing Systems

Recent years have witnessed significant advancements in industrial anomaly detection (IAD) thanks to existing anomaly detection datasets. However, the large performance gap between these benchmarks and real industrial practice reveals critical limitations in existing datasets. We argue that the mismatch between current datasets and real industrial scenarios becomes the primary barrier to practical IAD deployment. To this end, we propose ReinAD dataset, a comprehensive contrastive dataset towards Real-world industrial Anomaly Detection. Our dataset prioritizes three critical real-world requirements: 1) Contrast-based anomaly definition that is essential for industrial practice, 2) Fine-grained unaligned image pairs reflecting real inspections, and 3) Large-scale data from active production lines spanning multiple industrial categories. Based on our dataset, we introduce the ReinADNet. It takes both normal reference and test images as inputs, achieving anomaly detection through normal-anomaly comparison. To address the fine-grained and unaligned properties of real industrial scenes, our method integrates pyramidal similarity aggregation for comprehensive anomaly characterization and globallocal feature fusion for spatial misalignment tolerance. Our method outperforms all baselines on the ReinAD dataset (e.g., 64.5% v.s.



More effort is needed to protect pedestrian privacy in the era of AI

Neural Information Processing Systems

In the era of artificial intelligence (AI), pedestrian privacy is increasingly at risk. In research areas such as autonomous driving, computer vision, and surveillance, large datasets are often collected in public spaces, capturing pedestrians without consent or anonymization. These datasets are used to train systems that can identify, track, and analyze individuals, often without their knowledge. Although various technical methods and regional regulations have been proposed to address this issue, existing solutions are either insufficient to protect privacy or compromise data utility, thereby limiting their effectiveness for research. In this paper, we argue that more effort is needed to protect pedestrian privacy in the era of AI while maintaining data utility. We call on the AI and computer vision communities to take pedestrian privacy seriously and to rethink how pedestrian data are collected and anonymized. Collaboration with experts in law and ethics will also be essential for the responsible development of AI. Without stronger action, it will become increasingly difficult for individuals to protect their privacy, and public trust in AI may decline.


Fairness-Regularized Online Optimization with Switching Costs

Neural Information Processing Systems

Fairness and action smoothness are two crucial considerations in many online optimization problems, but they have yet to be addressed simultaneously. In this paper, we study a new and challenging setting of fairness-regularized smoothed online convex optimization with switching costs. First, to highlight the fundamental challenges introduced by the long-term fairness regularizer evaluated based on the entire sequence of actions, we prove that even without switching costs, no online algorithms can possibly achieve a sublinear regret or finite competitive ratio compared to the offline optimal algorithm as the problem episode length T increases. Then, we propose FairOBD(Fairness-regularized Online Balanced Descent), which reconciles the tension between minimizing the hitting cost, switching cost, and fairness cost.