Goto

Collaborating Authors

 Industry




Taiwan president cancels trip after African countries close airspace

BBC News

Taiwan President Lai Ching-te has cancelled a presidential trip to the African nation of Eswatini, accusing Beijing of putting pressure on its neighbours to bar his aircraft from flying over their territories. Seychelles, Mauritius and Madagascar revoked Lai's overflight permits after intense pressure and economic coercion from China, said a Taiwan official. China denied coercion, while praising the three African countries saying it had high appreciation for them. This is the first publicly known instance where a Taiwanese leader has had to cancel a foreign trip due to revoked flight permits. Eswatini, formerly known as Swaziland, is Taiwan's only diplomatic ally in Africa.


iRobot Promo Code: 15% Off

WIRED

Save on iRobot products, including robot vacuums and mops designed to handle pet hair, daily messes, and hands-free cleaning with smart home integration. The brand iRobot launched the first Roomba robot vacuum back in 2002, and popularity for the handy devices skyrocketed from there. Countless competitors have emerged, but Roomba is still going strong. Its latest models have all the new features we love, from doubling as a vacuum and a mop to fantastic navigation and suction. The Roomba Max 705 is currently keeping my house clean as I test it for our robot vacuum guide, and it's doing a great job both mopping and vacuuming the floors in my massive second story.


Large-Scale Price Optimization via Network Flow

Neural Information Processing Systems

This paper deals with price optimization, which is to find the best pricing strategy that maximizes revenue or profit, on the basis of demand forecasting models. Though recent advances in regression technologies have made it possible to reveal price-demand relationship of a large number of products, most existing price optimization methods, such as mixed integer programming formulation, cannot handle tens or hundreds of products because of their high computational costs. To cope with this problem, this paper proposes a novel approach based on network flow algorithms. We reveal a connection between supermodularity of the revenue and cross elasticity of demand. On the basis of this connection, we propose an efficient algorithm that employs network flow algorithms. The proposed algorithm can handle hundreds or thousands of products, and returns an exact optimal solution under an assumption regarding cross elasticity of demand. Even if the assumption does not hold, the proposed algorithm can efficiently find approximate solutions as good as other state-of-the-art methods, as empirical results show.



Without-Replacement Sampling for Stochastic Gradient Methods Ohad Shamir Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot, Israel ohad.shamir@weizmann.ac.il

Neural Information Processing Systems

Stochastic gradient methods for machine learning and optimization problems are usually analyzed assuming data points are sampled with replacement. In contrast, sampling without replacement is far less understood, yet in practice it is very common, often easier to implement, and usually performs better. In this paper, we provide competitive convergence guarantees for without-replacement sampling under several scenarios, focusing on the natural regime of few passes over the data. Moreover, we describe a useful application of these results in the context of distributed optimization with randomly-partitioned data, yielding a nearly-optimal algorithm for regularized least squares (in terms of both communication complexity and runtime complexity) under broad parameter regimes. Our proof techniques combine ideas from stochastic optimization, adversarial online learning and transductive learning theory, and can potentially be applied to other stochastic optimization and learning problems.


Stochastic Online AUC Maximization

Neural Information Processing Systems

Area under ROC (AUC) is a metric which is widely used for measuring the classification performance for imbalanced data. It is of theoretical and practical interest to develop online learning algorithms that maximizes AUC for large-scale data. A specific challenge in developing online AUC maximization algorithm is that the learning objective function is usually defined over a pair of training examples of opposite classes, and existing methods achieves on-line processing with higher space and time complexity. In this work, we propose a new stochastic online algorithm for AUC maximization. In particular, we show that AUC optimization can be equivalently formulated as a convex-concave saddle point problem. From this saddle representation, a stochastic online algorithm (SOLAM) is proposed which has time and space complexity of one datum. We establish theoretical convergence of SOLAM with high probability and demonstrate its effectiveness on standard benchmark datasets.


Young Chinese use AI to launch one-person firms over job anxiety

The Japan Times

One-person company SoloNest sounder Karen Dai preparing for a coffee chat at a conference room in Shanghai on April 12. | AFP-JIJI Shanghai - Young Chinese, many who fear age discrimination in their workplace after turning 35, are increasingly starting one-person companies that have artificial intelligence do most of the work. Smaller startups are already in vogue in Silicon Valley and elsewhere, with rapidly advancing AI tools seen as a welcome teammate even as they threaten layoffs at existing firms. More young people in China are subscribing to the model, as cities pledge millions of dollars in funding and rent subsidies for such ventures, in alignment with Beijing's political goal of technological self-reliance. In a time of both misinformation and too much information, quality journalism is more crucial than ever. By subscribing, you can help us get the story right.


Pentagon seeks 75 billion for drones in record budget ask

The Japan Times

A soldier carries a drone during a military parade in Washington on June 14, 2025. The Pentagon's largest-ever budget request earmarks $75 billion for drones and technologies to counter them, mainly for a massive increase for a little-known office working with U.S. commandos to test and evaluate various systems, according to defense officials. The drone-funding proposal includes $54.6 billion for the Defense Autonomous Working Group, or DAWG, from just $225.9 million this year. That would appear to be the largest single year-over-year boost of any defense program or office, meaning it's likely to draw particular congressional and public scrutiny in an already eye-catching $1.5 trillion request that's 42% larger than this year's budget. The big boost for the Pentagon's little-known drone unit comes as the U.S. and Israeli war against Iran illustrates how drones can help level the playing field against even the world's most well-funded armed forces.