A large class of machine learning techniques requires the solution of optimization problems involving spectral functions of parametric matrices, e.g.

This paper studies the problem of sparse regression where the goal is to learn a sparse vector that best optimizes a given objective function. Under the assumption that the objective function satisfies restricted strong convexity (RSC), we analyze orthogonal matching pursuit (OMP), a greedy algorithm that is used heavily in applications, and obtain support recovery result as well as a tight generalization error bound for OMP. Furthermore, we obtain lower bounds for OMP, showing that both our results on support recovery and generalization error are tight up to logarithmic factors. To the best of our knowledge, these support recovery and generalization bounds are the first such matching upper and lower bounds (up to logarithmic factors) for {\em any} sparse regression algorithm under the RSC assumption.

This material may not be published, broadcast, rewritten, or redistributed. Quotes displayed in real-time or delayed by at least 15 minutes. Market data provided by Factset . Powered and implemented by FactSet Digital Solutions . Mutual Fund and ETF data provided by LSEG .

Two people have died following an outbreak of invasive meningitis at the University of Kent. BBC South East understands that a further 11 people from the Canterbury area are currently in hospital and reported to be seriously ill. It is understood that most are aged between 18 and 21 and are students at the university. Both of the people who have died are also believed to be between 18 and 21, with one also confirmed to be a student. More than 30,000 students, staff and their families are being contacted by the UK Health Security Agency (UKHSA) to inform them of the situation.

Embark Studios' CEO Patrick Söderlund admitted that there is a quality difference when it comes to using voice actors versus AI. In an unexpected twist, humans have taken some jobs back from AI. Embark Studios' CEO Patrick Söderlund recently told that the studio re-recorded some of the AI-generated voice lines in with human voices, only after its successful launch in October. There is a quality difference, Söderlund told A real professional actor is better than AI; that's just how it is. With Arc Raiders' player count peaking at nearly half a million users on Steam, the game's breakout success was still marred by its use of text-to-speech AI. While there was no generative AI used for the visuals of the extraction shooter, Embark Studios paid its actors for approval to license their voices for text-to-speech AI, according to Söderlund.

We present an approach for simultaneously separating and localizing multiple sound sources using recorded microphone data. Inspired by topic models, our approach is based on a probabilistic model of inter-microphone phase differences, and poses separation and localization as a Bayesian inference problem. We assume sound activity is locally smooth across time, frequency, and location, and use the known position of the microphones to obtain a consistent separation. We compare the performance of our method against existing algorithms on simulated anechoic voice data and find that it obtains high performance across a variety of input conditions.

This material may not be published, broadcast, rewritten, or redistributed. Quotes displayed in real-time or delayed by at least 15 minutes. Market data provided by Factset . Powered and implemented by FactSet Digital Solutions . Mutual Fund and ETF data provided by LSEG .

Sketching and stochastic gradient methods are arguably the most common techniques to derive efficient large scale learning algorithms. In this paper, we investigate their application in the context of nonparametric statistical learning. More precisely, we study the estimator defined by stochastic gradient with mini batches and random features. The latter can be seen as form of nonlinear sketching and used to define approximate kernel methods. The considered estimator is not explicitly penalized/constrained and regularization is implicit. Indeed, our study highlights how different parameters, such as number of features, iterations, step-size and mini-batch size control the learning properties of the solutions. We do this by deriving optimal finite sample bounds, under standard assumptions. The obtained results are corroborated and illustrated by numerical experiments.

Anthropic is doubling Claude's usage limits during off-peak hours for the next two weeks The promotion runs from March 13 to March 27. To capitalize on Claude's recent spike in popularity, Anthropic is offering a limited-time promotion that doubles usage limits for anyone using its AI chatbot during off-peak hours. From March 13 to March 27, users on Free, Pro, Max, and Team plans will get double the usage limits in a five-hour window when using Claude outside weekday hours between 8 AM and 2 PM ET. According to Anthropic, the promotion is automatic, and users don't have to enable anything to get the benefits. A small thank you to everyone using Claude: We're doubling usage outside our peak hours for the next two weeks.

Smart glasses privacy concerns prompt Android app Nearby Glasses by Yves Jeanrenaud that detects hidden cameras by scanning Bluetooth signals from Meta and Snap devices.