Goto

Collaborating Authors

 Deep Learning


A powerful ChatGPT feature could be coming to Gemini

PCWorld

PCWorld reports that Google's Gemini may soon receive conversation branching functionality, a feature currently unique to ChatGPT among major AI chatbots. This capability allows users to explore different conversational paths from any point without losing the original thread, enhancing experimentation and control. Android Authority discovered hints of this upcoming feature in Gemini's code, while competitors like Claude still lack branching functionality. Ever wish you could take an existing AI conversation in an entirely new directory while keeping the original chat thread intact? ChatGPT makes it easy with its "branching" feature, but Claude and Gemini don't offer any branching functionality-or at least, not yet.


Enhancing Multiple Dimensions of Trustworthiness in LLMs via Sparse Activation Control

Neural Information Processing Systems

As the development and application of Large Language Models (LLMs) continue to advance rapidly, enhancing their trustworthiness and aligning them with human preferences has become a critical area of research. Traditional methods rely heavily on extensive data for Reinforcement Learning from Human Feedback (RLHF), but representation engineering offers a new, training-free approach. This technique leverages semantic features to control the representation of LLM's intermediate hidden states, enabling the model to meet specific requirements such as increased honesty or heightened safety awareness. However, a significant challenge arises when attempting to fulfill multiple requirements simultaneously. It proves difficult to encode various semantic contents, like honesty and safety, into a singular semantic feature, restricting its practicality.In this work, we address this challenge through Sparse Activation Control. By delving into the intrinsic mechanisms of LLMs, we manage to identify and pinpoint modules that are closely related to specific tasks within the model, i.e. attention heads. These heads display sparse characteristics that allow for near-independent control over different tasks. Our experiments, conducted on the open-source Llama series models, have yielded encouraging results. The models were able to align with human preferences on issues of safety, factualness, and bias concurrently.


Why Walmart and OpenAI Are Shaking Up Their Agentic Shopping Deal

WIRED

After OpenAI's Instant Checkout feature fell short, Walmart is instead embedding its Sparky chatbot directly into ChatGPT and Google Gemini. Since November, Walmart has let some ChatGPT users order a limited selection of products without ever leaving OpenAI's chatbot interface. Sales have been disappointing, a Walmart executive vice president exclusively tells WIRED. The results suggest that a future where chatbots and AI agents take over ecommerce is still a way off, if it ever materializes. Last year, OpenAI made a bet that it could boost revenue by charging a commission on purchases made through ChatGPT.


ChatQA: Surpassing GPT-4 on Conversational QA and RAG

Neural Information Processing Systems

In this work, we introduce ChatQA, a suite of models that outperform GPT-4 on retrieval-augmented generation (RAG) and conversational question answering (QA). To enhance generation, we propose a two-stage instruction tuning method that significantly boosts the performance of RAG. For effective retrieval, we introduce a dense retriever optimized for conversational QA, which yields results comparable to the alternative state-of-the-art query rewriting models, while substantially reducing deployment costs. We also present the ChatRAG Bench, which encompasses ten datasets covering comprehensive evaluations on RAG, table-related QA, arithmetic calculations, and scenarios involving unanswerable questions.


Learning Efficient Vision Transformers via Fine-Grained Manifold Distillation

Neural Information Processing Systems

In the past few years, transformers have achieved promising performance on various computer vision tasks. Unfortunately, the immense inference overhead of most existing vision transformers withholds them from being deployed on edge devices such as cell phones and smart watches. Knowledge distillation is a widely used paradigm for compressing cumbersome architectures into compact students via transferring information. However, most of them are designed for convolutional neural networks (CNNs), which do not fully investigate the character of vision transformers. In this paper, we fully utilize the patch-level information and propose a fine-grained manifold distillation method for transformer-based networks. Specifically, we train a tiny student model to match a pre-trained teacher model in the patch-level manifold space. Then, we decouple the manifold matching loss into three terms with careful design to further reduce the computational costs for the patch relationship. Equipped with the proposed method, a DeiT-Tiny model containing 5M parameters achieves 76.5\% top-1 accuracy on ImageNet-1k, which is +2.0\% higher than previous distillation approaches. Transfer learning results on other classification benchmarks and downstream vision tasks also demonstrate the superiority of our method over the state-of-the-art algorithms.


BLAST: Block-Level Adaptive Structured Matrices for Efficient Deep Neural Network Inference

Neural Information Processing Systems

Large-scale foundation models have demonstrated exceptional performance in language and vision tasks. However, the numerous dense matrix-vector operations involved in these large networks pose significant computational challenges during inference. To address these challenges, we introduce the Block-Level Adaptive STructured (BLAST) matrix, designed to learn and leverage efficient structures prevalent in the weight matrices of linear layers within deep learning models. Compared to existing structured matrices, the BLAST matrix offers substantial flexibility, as it can represent various types of structures that are either learned from data or computed from pre-existing weight matrices. We demonstrate the efficiency of using the BLAST matrix for compressing both language and vision tasks, showing that (i) for medium-sized models such as ViT and GPT-2, training with BLAST weights boosts performance while reducing complexity by 70\% and 40\%, respectively; and (ii) for large foundation models such as Llama-7B and DiT-XL, the BLAST matrix achieves a 2x compression while exhibiting the lowest performance degradation among all tested structured matrices.


Unconditional stability of a recurrent neural circuit implementing divisive normalization

Neural Information Processing Systems

Stability in recurrent neural models poses a significant challenge, particularly in developing biologically plausible neurodynamical models that can be seamlessly trained. Traditional cortical circuit models are notoriously difficult to train due to expansive nonlinearities in the dynamical system, leading to an optimization problem with nonlinear stability constraints that are difficult to impose. Conversely, recurrent neural networks (RNNs) excel in tasks involving sequential data but lack biological plausibility and interpretability. In this work, we address these challenges by linking dynamic divisive normalization (DN) to the stability of oscillatory recurrent gated neural integrator circuits'' (ORGaNICs), a biologically plausible recurrent cortical circuit model that dynamically achieves DN and that has been shown to simulate a wide range of neurophysiological phenomena. By using the indirect method of Lyapunov, we prove the remarkable property of unconditional local stability for an arbitrary-dimensional ORGaNICs circuit when the recurrent weight matrix is the identity. We thus connect ORGaNICs to a system of coupled damped harmonic oscillators, which enables us to derive the circuit's energy function, providing a normative principle of what the circuit, and individual neurons, aim to accomplish. Further, for a generic recurrent weight matrix, we prove the stability of the 2D model and demonstrate empirically that stability holds in higher dimensions. Finally, we show that ORGaNICs can be trained by backpropagation through time without gradient clipping/scaling, thanks to its intrinsic stability property and adaptive time constants, which address the problems of exploding, vanishing, and oscillating gradients. By evaluating the model's performance on RNN benchmarks, we find that ORGaNICs outperform alternative neurodynamical models on static image classification tasks and perform comparably to LSTMs on sequential tasks.


Microsoft is halting forced installs of Microsoft 365 Copilot app

PCWorld

PCWorld reports Microsoft has stopped automatically installing Microsoft 365 Copilot on Windows 11 following significant user backlash against forced AI integration. This decision addresses privacy concerns after a previous Copilot bug allowed unauthorized access to confidential Outlook emails. Administrators can still manually deploy the AI assistant, while existing installations remain unaffected by this policy change. Since October, the Microsoft 365 Copilot app has been automatically installed on computers running Windows 11, a move that has upset many users. Fortunately, Microsoft has taken the criticism on board and is no longer automatically installing this app--for now.


Catastrophic Goodhart: regularizing RLHF with KL divergence does not mitigate heavy-tailed reward misspecification

Neural Information Processing Systems

When applying reinforcement learning from human feedback (RLHF), the reward is learned from data and, therefore, always has some error. It is common to mitigate this by regularizing the policy with KL divergence from a base model, with the hope that balancing reward with regularization will achieve desirable outcomes despite this reward misspecification. We show that when the reward function has light-tailed error, optimal policies under less restrictive KL penalties achieve arbitrarily high utility. However, if error is heavy-tailed, some policies obtain arbitrarily high reward despite achieving no more utility than the base model--a phenomenon we call catastrophic Goodhart. We adapt a discrete optimization method to measure the tails of reward models, finding that they are consistent with light-tailed error. However, the pervasiveness of heavy-tailed distributions in many real-world applications indicates that future sources of RL reward could have heavy-tailed error, increasing the likelihood of reward hacking even with KL regularization.


Nvidia's DLSS 5 isn't a tool. It's an invasion

PCWorld

When you purchase through links in our articles, we may earn a small commission. When AI starts redrawing characters and lighting, who's really in control of the art? Because it makes a game look how Nvidia thinks it should look--and uses AI to do it. Nvidia's newly-announced DLSS 5 is an Nvidia feature that injects new details like textures and lighting via generative AI into supported games, all done using the GPU. It's quickly become the focal point of an increasingly vicious battle between human artists and AI.