Country
Don't Listen to Anyone Who Thinks Secession Will Solve Anything
Don't Listen to Anyone Who Thinks Secession Will Solve Anything Americans increasingly fantasize about a divorce between red and blue states--but they dread the thought of civil war. You can't have one without the other. It's become almost like a histamine response: After a shocking national event like the assassination of Charlie Kirk, or Donald Trump's deployment of the military to Los Angeles last June, mentions of the term " civil war " and calls for secession surge online. This kind of talk flared again in January, when two citizens were shot and killed by immigration agents on the streets of Minneapolis, and governor Tim Walz mobilized the Minnesota National Guard to be ready to support local law enforcement. "I mean, is this a Fort Sumter?" Walz said in an interview with The Atlantic, invoking the battle that sparked the Civil War.
Meet the Gods of AI Warfare
In its early days, the AI initiative known as Project Maven had its fair share of skeptics at the Pentagon. Today, many of them are true believers. The rise of AI warfare speaks to the biggest moral and practical question there is: Who--or what--gets to decide to take a human life? And who bears that cost? In 2018, more than 3,000 Google workers protested the company's involvement in "the business of war" after finding out the company was part of Project Maven, then a nascent Pentagon effort to use computer vision to rifle through copious video footage taken in America's overseas drone wars. They feared Project Maven's AI could one day be used for lethal targeting. In my yearslong effort to uncover the full story of Project Maven for my book,, I learned that is exactly what happened, and that the undertaking was just as controversial inside the Pentagon. Today, the tool known as Maven Smart System is being used in US operations against Iran . How the US military's top brass moved from skepticism about the use of AI in war to true believers has a lot to do with a Marine colonel named Drew Cukor. In early September 2024, during the cocktail hour at a private retreat for tech investors and defense leaders, Vice Admiral Frank "Trey" Whitworth found his way to Drew Cukor. Now Project Maven's founding leader and his skeptical successor were standing face-to-face. Three years earlier, Whitworth had been the Pentagon's top military official for intelligence, advising the chairman of the Joint Chiefs of Staff and running one of the most sensitive and potentially lethal parts of any military process: targeting.
Under the Influence at the Whitney Biennial
How the artists in this year's survey do or, more often, don't acknowledge those who paved the way for them. Machado makes pieces that one might call documents of reverence, excavated burial grounds. If nothing else, the 2026 Whitney Biennial, curated by Marcela Guerrero and Drew Sawyer (at the Whitney Museum through August 23rd), introduces viewers to what I call ChatGPT art--facsimiles of facsimiles by makers who have little if any relationship to what they're putting out there, aside from its being a product in service of a career. Indeed, it's difficult to think of the people who grew up with and apparently condone the use of A.I. sources in the creation of "art" as artists themselves, especially if you define art as a creative expression of thoughts or feelings that have changed, and contributed to the vision of, the artists who made it. It's true that, nearly from the beginning, postmodern art challenged the notion of originality, or, more specifically, the weight of originality--often with great joy and wit and not a little fear.
Sparse Support Recovery with Non-smooth Loss Functions
Kรฉvin Degraux, Gabriel Peyrรฉ, Jalal Fadili, Laurent Jacques
In this paper, we study the support recovery guarantees of underdetermined sparse regression using the `1-norm as a regularizer and a non-smooth loss function for data fidelity. More precisely, we focus in detail on the cases of `1 and ` losses, and contrast them with the usual `2 loss. While these losses are routinely used to account for either sparse (`1 loss) or uniform (` loss) noise models, a theoretical analysis of their performance is still lacking. In this article, we extend the existing theory from the smooth `2 case to these non-smooth cases. We derive a sharp condition which ensures that the support of the vector to recover is stable to small additive noise in the observations, as long as the loss constraint size is tuned proportionally to the noise level. A distinctive feature of our theory is that it also explains what happens when the support is unstable. While the support is not stable anymore, we identify an "extended support" and show that this extended support is stable to small additive noise. To exemplify the usefulness of our theory, we give a detailed numerical analysis of the support stability/instability of compressed sensing recovery with these different losses. This highlights different parameter regimes, ranging from total support stability to progressively increasing support instability.
Exploiting Tradeoffs for Exact Recovery in Heterogeneous Stochastic Block Models
Amin Jalali, Qiyang Han, Ioana Dumitriu, Maryam Fazel
The Stochastic Block Model (SBM) is a widely used random graph model for networks with communities. Despite the recent burst of interest in community detection under the SBM from statistical and computational points of view, there are still gaps in understanding the fundamental limits of recovery. In this paper, we consider the SBM in its full generality, where there is no restriction on the number and sizes of communities or how they grow with the number of nodes, as well as on the connectivity probabilities inside or across communities. For such stochastic block models, we provide guarantees for exact recovery via a semidefinite program as well as upper and lower bounds on SBM parameters for exact recoverability. Our results exploit the tradeoffs among the various parameters of heterogenous SBM and provide recovery guarantees for many new interesting SBM configurations.
R-FCN: Object Detection via Region-based Fully Convolutional Networks
jifeng dai, Yi Li, Kaiming He, Jian Sun
We present region-based, fully convolutional networks for accurate and efficient object detection. In contrast to previous region-based detectors such as Fast/Faster R-CNN [7, 19] that apply a costly per-region subnetwork hundreds of times, our region-based detector is fully convolutional with almost all computation shared on the entire image. To achieve this goal, we propose position-sensitive score maps to address a dilemma between translation-invariance in image classification and translation-variance in object detection. Our method can thus naturally adopt fully convolutional image classifier backbones, such as the latest Residual Networks (ResNets) [10], for object detection. We show competitive results on the PASCAL VOC datasets (e.g., 83.6% mAP on the 2007 set) with the 101-layer ResNet. Meanwhile, our result is achieved at a test-time speed of 170ms per image, 2.5-20 faster than the Faster R-CNN counterpart.