AI's'opportunity divide' could deepen global inequality, UN official warns Share AI's'opportunity divide' could deepen global inequality, UN official warns on social media Artificial intelligence (AI) risks widening the gap between rich and poor countries, potentially deepening existing social and economic inequalities, a senior United Nations official has warned. Developing countries face significant barriers to benefitting from the AI revolution, Tomas Lamanauskas, the deputy secretary-general of the International Telecommunication Union (ITU), a UN agency focused on information and communication technologies, told Al Jazeera. "AI has the huge potential of powering health, education, public services, industries, agriculture, trade. So a great divide could really mean an opportunity divide, and really could deepen the socioeconomic divide," he said. Lamanauskas said the disparities are already evident in digital infrastructure, citing the examples of Africa and Latin America, which together account for just 3.3 percent of global data centre capacity.

From France to India, young people are in the streets over inequality, failing public services and bleak prospects.

Follow this section to personalize your feed and get instant alerts. Follow Go to your personalized feed WHY FOLLOW? Smart Alerts: Get notified about major news as it happens. Follow this tag to personalize your feed and get instant alerts. Follow Go to your personalized feed WHY FOLLOW?

Follow this section to personalize your feed and get instant alerts. Follow Go to your personalized feed WHY FOLLOW? Smart Alerts: Get notified about major news as it happens. Follow this tag to personalize your feed and get instant alerts. Follow Go to your personalized feed WHY FOLLOW?

Follow this section to personalize your feed and get instant alerts. Follow Go to your personalized feed WHY FOLLOW? Smart Alerts: Get notified about major news as it happens. Follow this tag to personalize your feed and get instant alerts. Follow Go to your personalized feed WHY FOLLOW? Smart Alerts: Get notified about major news as it happens.

Taylor Swift marries Travis Kelce in'moving' ceremony where the bride wore Dior and walked down the aisle to one of her own songs... before partying the night away at Madison Square Garden Mississippi teen's'bad decision' cost him his life just days after graduation, mom says, as mourning family demands answers Lena Dunham leaves Taylor Swift wedding guests GASPING with shockingly rude dinner speech after taking microphone... as world famous celeb is dramatically turned away: Insiders leak outrageous MSG gossip Blake Lively's fury after Taylor Swift left her off wedding guest list as sources say it's the final straw Taylor Swift's celebrity wedding guests FLEE lavish MSG reception early... as Travis Kelce extravaganza runs into the early hours The WORST dressed guests at Taylor Swift and Travis Kelce's lavish wedding Does this photo capture Travis Kelce's last dose of Dutch courage before marriage? After all the wild lengths Taylor went to hide wedding... one image seems all too human Probe into fiery Missouri plane crash that killed 11 skydivers and pilot takes shocking twist... as investigators reveal head-scratching findings Trump takes swipe at Iranian leaders during America 250 speech revealing he gave them'a week off' for Ayatollah funeral Meghan's Taylor Swift wedding humiliation: KENNEDY's Montecito mole tells all as Prince William rubs salt in the wound! Bruised Tom Selleck feasts on McDonald's just after gym visit as fears grow about actor's grim new look All the BEST dressed guests at Taylor Swift and Travis Kelce's extravagant wedding Taylor Swift's wedding officiant is Adam Sandler! Twisted family secrets of postal worker mom, 35, slaughtered on delivery route just six months after husband's shock death: Horrifying new details of her final moments emerge The end of the America we know? Victoria Beckham risks Brooklyn's fury as she extends another olive branch in anniversary post for David - after'fuming' son said he'wished they'd stop posting about him' Taylor Swift's '40-page prenup': How $2BILLION in assets divide up... and the one major concession Travis is predicted to have written in as special clause Iconic Las Vegas casinos' years-long infestation with bed bugs exposed...as unearthed records reveal YEARS of disgusting stays that have sent mortified guests fleeing Elon Musk's next target could be your smartphone as SpaceX schemes to take on America's biggest mobile phone companies TV icon, 84, shares rare throwback photos ahead of Fourth of July holiday... can you guess who it is?

Recent work has established a fundamental trilemma between Byzantine robustness, local differential privacy (LDP), and optimization error in distributed learning. We show that this trilemma does not universally extend to generalization error, but instead depends critically on the privacy regime. Specifically, in the high-noise regime (strong privacy), we prove that increasing privacy reduces the generalization error, i.e., there is no tension between robustness and privacy. In the low-noise regime (weaker privacy), however, the tension between robustness and privacy reappears and increasing privacy indeed degrades generalization. Our theory explains this surprising non-monotonic behavior of the generalization error via matching lower and upper bounds on the algorithmic stability of Byzantine-robust distributed learning under LDP constraints. We corroborate and further analyze these theoretical findings with empirical evaluations.

The aggregation with exponential weights (AEW) estimator is not fully understood in the basic setting of model selection aggregation with squared loss. In particular, whether it is minimax-rate optimal in expectation for large enough fixed temperatures and under random design has been an open problem since its introduction, which was explicitly posed by Lecué and Mendelson (2013). In this paper, we settle this problem by showing that \emph{without} requiring a Bernstein-type assumption, the AEW indeed achieves the excess risk $T \log (M) / (n+1)$ in expectation, whenever the temperature $T$ satisfies $(L^2/T)\exp(B/T)\leq μ/2$. Here, the number of dictionary elements is $M$, the estimator has observed $n$ i.i.d. samples from any distribution, and the loss is assumed to be bounded by $B$, $L$-Lipschitz continuous and $μ$-strongly convex. For squared loss, we show that $T\geq 4 b^2$ suffices when the predictions and labels are $[0,b]$-valued. Because AEW is known to be suboptimal in expectation for temperatures below some constant, this shows that AEW has a sharp phase transition when the temperature is large enough but constant, as conjectured by Lecué and Mendelson.

We study uniform-in-time propagation-of-chaos for continuous-time Stein Variational Gradient Descent (SVGD). Classical finite-time propagation-of-chaos estimates for mean-field systems typically deteriorate rapidly with time and therefore do not directly explain the long-time relation between the finite-particle system and its mean-field limit. We obtain two complementary classes of uniform-in-time propagation-of-chaos results. For broad distributional metrics, we introduce a cutoff strategy which combines finite-time propagation-of-chaos estimates up to an $N$-dependent horizon with independent quantitative long-time convergence estimates for the finite-particle and mean-field SVGD flows. This yields uniform-in-averaging-time propagation-of-chaos bounds in Langevin kernel Stein discrepancy, Wasserstein-1 distance, and Wasserstein-2 distance, with logarithmic or iterated-logarithmic rates depending on the metric, target and kernel class. We also develop a finite-dimensional theory for matrix-valued finite-rank kernels. For Gaussian targets with bilinear kernels, the SVGD dynamics close exactly on first and second moments, yielding genuine uniform-in-physical-time parametric propagation-of-chaos rates in finite-dimensional Stein-feature metrics. We then prove a conjugacy principle showing that these feature-level estimates transfer to conjugate target-kernel pairs under orientation-preserving diffeomorphisms, thereby extending the theory to broad classes of nonlinear, including multimodal, targets. Together, these results highlight the contrast between generic distributional metrics, for which our general approach yields logarithmic rates, and closed finite-dimensional Stein observables, for which parametric $N^{-1/2}$ propagation-of-chaos rates persist uniformly in time.

Machine learning algorithms and their training datasets have grown substantially in both size and complexity over the past decade. This increased model complexity has made it challenging to interpret and predict their behavior in unobserved scenarios. Hence, many applications that involve societal decisions still rely on simple, interpretable models like linear regression, often after feature engineering. Examples of such applications include predicting national housing prices, estimating wages across industries, forecasting loan amounts across banks, predicting life insurance premiums across groups, and projecting energy consumption across communities [CGKMN24]. A shared safety and sometimes legal concern across the above applications is the potential for wildly different model qualities for different distributions, i.e., outputting a notably worse model for some source data distributions [Dat14; BS16; HPS16; VVB18; SBFVV19; BHJKR21; CGNSG23; Cho16; KLMR18; ADW19; CGKMN24; SVWZ24].