collaborate
Claude can collaborate in your team meetings soon – like an intern
Our gifting experts are obsessively searching for holiday gifts that are unique, thoughtful and suitable for any budget. Claude is responding'Yes' to that calendar invite - with some limitations. Plus: Anthropic launches two more new features that are available now. Radhika Rajkumar is a senior editor at ZDNET based in New York City. Anthropic released new features for paid accounts.
He Trolls AI Labs for a Living. Now They All Want to Work With Him
OpenAI, Anthropic, and SpaceXSI have all reached out to Husk, an influencer who regularly goes viral by exposing the shortcomings of chatbots. OpenAI, Anthropic, and xAI have all asked creator Matt Husk to collaborate following the viral success of his videos trolling AI models. During the WIRED World Fair on Wednesday, Husk told the crowd "all the big AI companies" have inquired about working with him, including Elon Musk's xAI, which Husk claimed offered a Tesla for a week if he made videos exclusively for the firm. The comedian has gained some 2 million followers combined across Instagram, TikTok, and YouTube, as well as a deal with the talent agency Unicorn, through videoing himself making deadpan requests to ChatGPT's voice model--asking it to count to 100, or to beatbox, for example. His viral videos have exposed the weaknesses of OpenAI's LLM, which comically botches the tasks and swings between sycophancy and gaslighting Husk, and earned him the title of "Sam Altman's worst nightmare."
Nvidia to buy developer platform Hugging Face in 12.9bn deal
Nvidia's acquisition of Hugging Face will give it direct access to platform developers use to collaborate, test and share tools Nvidia's acquisition of Hugging Face will give it direct access to platform developers use to collaborate, test and share tools Nvidia to buy developer platform Hugging Face in $12.9bn deal Nvidia will buy the popular developer platform Hugging Face for nearly $13bn, betting that support for open AI models could offset a potential slowdown in demand for the semiconductor giant's chips. Shares in Nvidia were slightly lower after the $12.93bn (£9.57bn) deal - which ranks among its biggest ever - was announced for the database of AI models on Thursday. The New York-based startup Hugging Face, which is backed by Intel, Advanced Micro Devices and Amazon, was founded in 2016 by the French entrepreneurs Clément Delangue, Julien Chaumond and Thomas Wolf. Nvidia's quarterly revenue doubles to nearly $100bn as CEO declares'golden age' The chipmaker is already a major open AI player in the US with its widely used Nemotron model and vocal support for the technology. Acquiring Hugging Face will give it direct access to a platform developers use to collaborate, test and share tools, potentially providing insight and data that could help it narrow the technology gap with top American and Chinese labs.
Belief-Calibrated Multi-Agent Consensus Seeking for Complex NLPTasks
A multi-agent system (MAS) enhances its capacity to solve complex natural language processing (NLP) tasks through collaboration among multiple agents, where consensus-seeking serves as a fundamental mechanism. However, existing consensus-seeking approaches typically rely on voting mechanisms to judge consensus, overlooking contradictions in system-internal beliefs that destabilize the consensus. Moreover, these methods often involve agents updating their results through indiscriminate collaboration with every other agent. Such uniform interaction fails to identify the optimal collaborators for each agent, hindering the emergence of a stable consensus. To address these challenges, we provide a theoretical framework for selecting optimal collaborators that maximize consensus stability. Based on the theorems, we propose the Belief-Calibrated Consensus Seeking (BCCS) framework to facilitate stable consensus via selecting optimal collaborators and calibrating the consensus judgment by system-internal beliefs. Experimental results on the MATH and MMLU benchmark datasets demonstrate that the proposed BCCS framework outperforms the best existing results by 2.23% and 3.95% of accuracy on challenging tasks, respectively.
Here's How AI Agents Can Protect EV Chargers
An AI agent system proposed by researchers in Spain promises to prevent energy theft and damage to EV chargers, as well as the critical energy infrastructure that powers them. The number of electric vehicles on roads around the world continues to grow. The boom in EV adoption has driven the development of accessible, fast, and efficient charging infrastructure. However, this expansion also brings with it new cybersecurity risks that have been not been widely studied, and for which there are still few viable solutions. Cristina Alcaraz, an infrastructure-security researcher at Spain's University of Malaga, explains that the liability of electric-vehicle charging stations is due to the fact that they integrate multiple physical and digital components.
Jeff Goldblum should make a film about this legendary mathematician
Paul Erdős was one of the most prolific mathematicians to ever live, known for showing up at the door of others in the field and declaring they should host and feed him while they do maths together. I come to you with something a little different for my latest maths column - a plea to Hollywood to make a comedy biopic about one of the greatest mathematicians of all time, Paul Erdős. Why is Erdős (pronounced "air-dish") deserving of such acclaim? With almost 1500 papers to his name, he is probably the most prolific mathematician that ever lived, and possibly that will ever live. Unsurprisingly, with that many papers, he is known for his work across many areas of maths, from probability to number theory to graph theory.
Effective Human-AI Teams via Learned Natural Language Rules and Onboarding
People are relying on AI agents to assist them with various tasks. The human must know when to rely on the agent, collaborate with the agent, or ignore its suggestions. In this work, we propose to learn rules grounded in data regions and described in natural language that illustrate how the human should collaborate with the AI. Our novel region discovery algorithm finds local regions in the data as neighborhoods in an embedding space that corrects the human prior. Each region is then described using an iterative and contrastive procedure where a large language model describes the region. We then teach these rules to the human via an onboarding stage. Through user studies on object detection and question-answering tasks, we show that our method can lead to more accurate human-AI teams. We also evaluate our region discovery and description algorithms separately.
Synergy-of-Experts: Collaborate to Improve Adversarial Robustness
Learning adversarially robust models require invariant predictions to a small neighborhood of its natural inputs, often encountering insufficient model capacity. There is research showing that learning multiple sub-models in an ensemble could mitigate this insufficiency, further improving the generalization and the robustness. However, the ensemble's voting-based strategy excludes the possibility that the true predictions remain with the minority. Therefore, this paper further improves the ensemble through a collaboration scheme---Synergy-of-Experts (SoE). Compared with the voting-based strategy, the SoE enables the possibility of correct predictions even if there exists a single correct sub-model. In SoE, every sub-model fits its specific vulnerability area and reserves the rest of the sub-models to fit other vulnerability areas, which effectively optimizes the utilization of the model capacity. Empirical experiments verify that SoE outperforms various ensemble methods against white-box and transfer-based adversarial attacks.
Collaborative Learning of Discrete Distributions under Heterogeneity and Communication Constraints
In modern machine learning, users often have to collaborate to learn distributions that generate the data. Communication can be a significant bottleneck. Prior work has studied homogeneous users---i.e., whose data follow the same discrete distribution---and has provided optimal communication-efficient methods. However, these methods rely heavily on homogeneity, and are less applicable in the common case when users' discrete distributions are heterogeneous. Here we consider a natural and tractable model of heterogeneity, where users' discrete distributions only vary sparsely, on a small number of entries. We propose a novel two-stage method named SHIFT: First, the users collaborate by communicating with the server to learn a central distribution; relying on methods from robust statistics. Then, the learned central distribution is fine-tuned to estimate the individual distributions of users. We show that our method is minimax optimal in our model of heterogeneity and under communication constraints. Further, we provide experimental results using both synthetic data and $n$-gram frequency estimation in the text domain, which corroborate its efficiency.
Hogwild! Inference: Parallel LLM Generation via Concurrent Attention
Rodionov, Gleb, Garipov, Roman, Shutova, Alina, Yakushev, George, Schultheis, Erik, Egiazarian, Vage, Sinitsin, Anton, Kuznedelev, Denis, Alistarh, Dan
Large Language Models (LLMs) have demonstrated the ability to tackle increasingly complex tasks through advanced reasoning, long-form content generation, and tool use. Solving these tasks often involves long inference-time computations. In human problem solving, a common strategy to expedite work is collaboration: by dividing the problem into sub-tasks, exploring different strategies concurrently, etc. Recent research has shown that LLMs can also operate in parallel by implementing explicit cooperation frameworks, such as voting mechanisms or the explicit creation of independent sub-tasks that can be executed in parallel. However, each of these frameworks may not be suitable for all types of tasks, which can hinder their applicability. In this work, we propose a different design approach: we run LLM "workers" in parallel , allowing them to synchronize via a concurrently-updated attention cache and prompt these workers to decide how best to collaborate. Our approach allows the LLM instances to come up with their own collaboration strategy for the problem at hand, all the while "seeing" each other's memory in the concurrent KV cache. We implement this approach via Hogwild! Inference: a parallel LLM inference engine where multiple instances of the same LLM run in parallel with the same attention cache, with "instant" access to each other's memory. Hogwild! Inference takes advantage of Rotary Position Embeddings (RoPE) to avoid recomputation while improving parallel hardware utilization. We find that modern reasoning-capable LLMs can perform inference with shared Key-Value cache out of the box, without additional fine-tuning.