Goto

Collaborating Authors

 anc


ANC under pressure to reverse South Africa decline

BBC News

South Africans are voting in highly contested local elections likely to see a haemorrhaging of votes for the country's former ruling party, the African National Congress (ANC). This year's voting season has been marked by intense campaigns that have included politicians spinning cars, watching grannies knit and even wading through giant-sized potholes. Leaders are campaigning to head South Africa's nearly 300 municipalities, responsible for basic service provision such as water, electricity and refuse collection. For the ANC, the elections are a chance to prove it still has what it takes to govern. The party had a disastrous showing in the last national election, when it lost its parliamentary majority for the first time since 1994 when the racist apartheid system ended.


The Beats 360 are eye-catching and impressively customizable, but does the listening experience match up?

Mashable

Mashable's Best: E-readers, robovacs, laptops, earbuds, smart home and more Safety Net Look Up Gift Ideas For Everyone On Your List Mashable @Home In My Bag Versus Trending Now Say More Creator Playbook Mashable Selects Getting Technical with Mashable All Series The Beats 360 are eye-catching and impressively customizable, but does the listening experience match up? Looks are one thing, listening experience is another. Bethany Allard is a Los Angeles-based shopping reporter at Mashable covering beauty tech, dating, sex and relationships, and headphones. That basically means she puts her hair through a lot, scrolls through a lot of dating apps, and rotates through a lot of different headphones. In addition to testing out and rounding up the best products, she also covers deals for Mashable, paying an especially obsessive amount of attention to Apple deals and prices.


Skip the 350 cans: Our favorite budget headphones are just under 70 at Amazon

Mashable

Mashable's Best: E-readers, robovacs, laptops, earbuds, smart home and more Look Up Gift Ideas For Everyone On Your List Mashable @Home In My Bag Safety Net Versus Trending Now Say More Creator Playbook Mashable Selects Getting Technical with Mashable All Series Soumya is a deals writer who covers consumer tech, shopping deals, and the products people use every day. With experience writing about everything from AI tools and software to smartphones and home gadgets, she enjoys breaking down product research into clear, useful recommendations. When she's not tracking deals, she's usually comparing products, digging through reviews, and figuring out what actually makes a purchase worth it. All products featured here are independently selected by our editors and writers. If you buy something through links on our site, Mashable may earn an affiliate commission.


The best gadgets and gear that debuted at IFA 2026

Popular Science

Why wait for the future of technology to arrive when you can see it here and now? These are the highlights from Europe's biggest tech show. 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. A humanoid robot from producer Midea is seen in front of the fair during the IFA Consumer Electronics and Home Appliances trade fair in Berlin, Germany, on September 5, 2026. We may earn revenue from the products available on this page and participate in affiliate programs.



On the Number of Conditional Independence Tests in Constraint-based Causal Discovery

arXiv.org Machine Learning

Learning causal relations from observational data is a fundamental problem with wide-ranging applications across many fields. Constraint-based methods infer the underlying causal structure by performing conditional independence tests. However, existing algorithms such as the prominent PC algorithm need to perform a large number of independence tests, which in the worst case is exponential in the maximum degree of the causal graph. Despite extensive research, it remains unclear if there exist algorithms with better complexity without additional assumptions. Here, we establish an algorithm that achieves a better complexity of $p^{\mathcal{O}(s)}$ tests, where $p$ is the number of nodes in the graph and $s$ denotes the maximum undirected clique size of the underlying essential graph. Complementing this result, we prove that any constraint-based algorithm must perform at least $2^{Ω(s)}$ conditional independence tests, establishing that our proposed algorithm achieves exponent-optimality up to a logarithmic factor in terms of the number of conditional independence tests needed. Finally, we validate our theoretical findings through simulations, on semi-synthetic gene-expression data, and real-world data, demonstrating the efficiency of our algorithm compared to existing methods in terms of number of conditional independence tests needed.