In the AI era, Apple's strengths may become its constraints Apple has expressed some willingness to use AI technology developed by rivals when needed. San Francisco - Apple built its empire on control. For decades, the company's tightly managed ecosystem, spanning custom chips, proprietary operating systems and curated apps, delivered devices that were secure and easy to use. That approach helped turn the iPhone into the most successful consumer product in history, generating nearly $210 billion in revenue last year. It also made Apple the world's top-valued company for much of the past decade, a position only overtaken by artificial intelligence chipmaker Nvidia in 2024.

In this paper, it is shown, for the first time, that centralized performance is achievable in decentralized learning without sharing the local datasets. Specifically, when clients adopt an empirical risk minimization with relative-entropy regularization (ERM-RER) learning framework and a forward-backward communication between clients is established, it suffices to share the locally obtained Gibbs measures to achieve the same performance as that of a centralized ERM-RER with access to all the datasets. The core idea is that the Gibbs measure produced by client~$k$ is used, as reference measure, by client~$k+1$. This effectively establishes a principled way to encode prior information through a reference measure. In particular, achieving centralized performance in the decentralized setting requires a specific scaling of the regularization factors with the local sample sizes. Overall, this result opens the door to novel decentralized learning paradigms that shift the collaboration strategy from sharing data to sharing the local inductive bias via the reference measures over the set of models.

Forecasting the life-cycle trajectory of a newly launched product is important for launch planning, resource allocation, and early risk assessment. This task is especially difficult in the pre-launch and early post-launch phases, when product-specific outcome history is limited or unavailable, creating a cold-start problem. In these phases, firms must make decisions before demand patterns become reliably observable, while early signals are often sparse, noisy, and unstable We propose the Conditional Diffusion Life-cycle Forecaster (CDLF), a conditional generative framework for forecasting new-product life-cycle trajectories under cold start. CDLF combines three sources of information: static descriptors, reference trajectories from similar products, and newly arriving observations when available. Here, static descriptors refer to structured pre-launch characteristics of the product, such as category, price tier, brand or organization identity, scale, and access conditions. This structure allows the model to condition forecasts on relevant product context and to update them adaptively over time without retraining, yielding flexible multi-modal predictive distributions under extreme data scarcity. The method satisfies consistency with a horizon-uniform distributional error bound for recursive generation. Across studies on Intel microprocessor stock keeping unit (SKU) life cycles and the platform-mediated adoption of open large language model repositories, CDLF delivers more accurate point forecasts and higher-quality probabilistic forecasts than classical diffusion models, Bayesian updating approaches, and other state-of-the-art machine-learning baselines.

Consider betting against a sequence of data in $[0,1]$, where one is allowed to make any bet that is fair if the data have a conditional mean $m_0 \in (0,1)$. Cover's universal portfolio algorithm delivers a worst-case regret of $O(\ln n)$ compared to the best constant bet in hindsight, and this bound is unimprovable against adversarially generated data. In this work, we present a novel mixture betting strategy that combines insights from Robbins and Cover, and exhibits a different behavior: it eventually produces a regret of $O(\ln \ln n)$ on \emph{almost} all paths (a measure-one set of paths if each conditional mean equals $m_0$ and intrinsic variance increases to $\infty$), but has an $O(\log n)$ regret on the complement (a measure zero set of paths). Our paper appears to be the first to point out the value in hedging two very different strategies to achieve a best-of-both-worlds adaptivity to stochastic data and protection against adversarial data. We contrast our results to those in~\cite{agrawal2025regret} for a sub-Gaussian mixture on unbounded data: their worst-case regret has to be unbounded, but a similar hedging delivers both an optimal betting growth-rate and an almost sure $\ln\ln n$ regret on stochastic data. Finally, our strategy witnesses a sharp game-theoretic upper law of the iterated logarithm, analogous to~\cite{shafer2005probability}.

Booking.com confirmed hackers may have accessed customer names, emails, phone numbers and booking details, though financial data was not compromised in the breach.

To be clear, we were never approached nor were we in any discussions regarding a partnership or tour access,

Environment Conservation Land Scientists sacrifice delicious opossums to fight Florida's invasive pythons More information Adding us as a Preferred Source in Google by using this link indicates that you would like to see more of our content in Google News results. Tracking them during digestion may help curb the snake population. Breakthroughs, discoveries, and DIY tips sent six days a week. Some of Florida's opossums may soon start dying for a noble cause. A few select marsupials fitted with tracking collars may begin to lead scientists to invasive Burmese pythons () slithering through the Everglades.

One group of hackers used AI for everything from vibe coding their malware to creating fake company websites--and stole as much as $12 million in three months. The advent of AI hacking tools has raised fears of a near future in which anyone can use automated tools to dig up exploitable vulnerabilities in any piece of software, like a kind of digital intrusion superpower. Here in the present, however, AI seems to be playing a more mundane, if still concerning, role in hackers' toolkit: It's helping mediocre hackers level up and carry out broad, effective malware campaigns. That includes one group of relatively unskilled North Korean cybercriminals who've been discovered using AI to carry out virtually every part of an operation that hacked thousands of victims to steal their cryptocurrency. On Wednesday, cybersecurity firm Expel revealed what it describes as a North Korean state-sponsored cybercrime operation that installed credential-stealing malware on more than 2,000 computers, specifically targeting the machines of developers working on small cryptocurrency launches, NFT creation, and Web3 projects.

A new executive order seen by WIRED prohibits New York state employees from using insider knowledge to enrich themselves with prediction market bets. New York has banned state employees from using insider information to trade on prediction markets . In an executive order signed today and viewed by WIRED, Governor Kathy Hochul forbade the state's government workforce from using "any nonpublic information obtained in the course of their official duties" to participate on prediction market platforms, or to help others profit using those services. "Getting rich by betting on inside information is corruption, plain and simple," Hochul said in a statement provided to WIRED. "Our actions will ensure that public servants work for the people they represent, not their own personal enrichment. While Donald Trump and DC Republicans turn a blind eye to the ethical Wild West they've created, New York is stepping up to lead by example and stamp out insider trading."

Spectral clustering and co-clustering are well-known techniques in data analysis, and recent work has extended spectral clustering to square, symmetric tensors and hypermatrices derived from a network. We develop a new tensor spectral co-clustering method that simultaneously clusters the rows, columns, and slices of a nonnegative three-mode tensor and generalizes to tensors with any number of modes. The algorithm is based on a new random walk model which we call the super-spacey random surfer. We show that our method out-performs state-of-the-art co-clustering methods on several synthetic datasets with ground truth clusters and then use the algorithm to analyze several real-world datasets.