schneider
Best gifts for mom 2026: 60 thoughtful gift ideas that are as special as she is
Gift Ideas For Everyone On Your List Mashable's Best: E-readers, robovacs, laptops, earbuds, smart home and more Safety Net Say More Look Up Mashable @Home In My Bag Versus Trending Now Creator Playbook Mashable Selects Getting Technical with Mashable All Series Surprise her with something sentimental or make her life easier with something practical. Leah Stodart is a Philadelphia-based Senior Shopping Reporter at Mashable where she covers and tests essential home tech like vacuums, TVs, beauty devices, and eco-friendly hacks. Her ever-evolving experience in these categories helps her make thoughtful recommendations for how to spend your money during shopping holidays like Black Friday, which Leah has been covering for Mashable since 2017. Previously, she was the site's Executive Editor and its very first Shopping Editor. Nicole is also Mashable's resident gifting expert and gets a thrill out of helping readers find the perfect present. She received a B.S. in Journalism from Boston University and an MFA in fiction writing from The New School. She lives in Maine with her husband, their three young children, and a backyard full of flowers . Han Schneider is a journalist who wants to talk about feeling better and what can help us get there. Whether that's product reviews and gift guides for the ADHD brain, deep dives into wellness trends that are actually worth their salt, or perseverating on the state of queer swimwear. Schneider has covered products and gift guides for Elite Daily, Refinery29, Allure, Best Products, Well + Good, and more.
ICE Is Getting Body Cameras. But Will They Help Hold Agents Accountable?
U.S. Open follow modal Personalized Content 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?
Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
We study online inverse linear optimization, also known as contextual recommendation, where a learner sequentially infers an agent's hidden objective vector from observed optimal actions over feasible sets that change over time. The learner aims to recommend actions that perform well under the agent's true objective, and the performance is measured by the regret, defined as the cumulative gap between the agent's optimal values and those achieved by the learner's recommended actions. Prior work has established a regret bound of $O(d\log T)$, as well as a finite but exponentially large bound of $\exp(O(d\log d))$, where $d$ is the dimension of the optimization problem and $T$ is the time horizon, while a regret lower bound of $ฮฉ(d)$ is known (Gollapudi et al. 2021; Sakaue et al. 2025). Whether a finite regret bound polynomial in $d$ is achievable or not has remained an open question. We partially resolve this by showing that when the feasible sets are M-convex -- a broad class that includes matroids -- a finite regret bound of $O(d\log d)$ is possible. We achieve this by combining a structural characterization of optimal solutions on M-convex sets with a geometric volume argument. Moreover, we extend our approach to adversarially corrupted feedback in up to $C$ rounds. We obtain a regret bound of $O((C+1)d\log d)$ without prior knowledge of $C$, by monitoring directed graphs induced by the observed feedback to detect corruptions adaptively.
Why Experts Can't Agree on Whether AI Has a Mind
Why Experts Can't Agree on Whether AI Has a Mind Pillay is an editorial fellow at TIME. Pillay is an editorial fellow at TIME. I'm not used to getting nasty emails from a holy man, says Professor Michael Levin, a developmental biologist at Tufts University. Levin was presenting his research to a group of engineers interested in spiritual matters in India, arguing that properties like "mind" and intelligence can be observed even in cellular systems, and that they exist on a spectrum. But when he pushed further--arguing that the same properties emerge everywhere, including in computers--the reception shifted.
Re-envisioning Euclid Galaxy Morphology: Identifying and Interpreting Features with Sparse Autoencoders
Wu, John F., Walmsley, Michael
Sparse Autoencoders (SAEs) can efficiently identify candidate monosemantic features from pretrained neural networks for galaxy morphology. We demonstrate this on Euclid Q1 images using both supervised (Zoobot) and new self-supervised (MAE) models. Our publicly released MAE achieves superhuman image reconstruction performance. While a Principal Component Analysis (PCA) on the supervised model primarily identifies features already aligned with the Galaxy Zoo decision tree, SAEs can identify interpretable features outside of this framework. SAE features also show stronger alignment than PCA with Galaxy Zoo labels. Although challenges in interpretability remain, SAEs provide a powerful engine for discovering astrophysical phenomena beyond the confines of human-defined classification.
Using Phonemes in cascaded S2S translation pipeline
Pilz, Rene, Schneider, Johannes
This paper explores the idea of using phonemes as a textual representation within a conventional multilingual simultaneous speech - to - speech translation pipeline, as opposed to the traditional reliance on text - based language representations. To investigate this, we trained an open - source sequence - to - sequence model on the WMT17 dataset in two formats: one using standard textual representation and the other employing phonemic representation. The performance o f both approaches was assessed using the BLEU metric. Our findings shows that the phonemic approach provides comparable quality but offers several advantages, including lower resource requirements or better suitability for low - resource languages.
Improving Next Tokens via Second-Last Predictions with Generate and Refine
Autoregressive language models like GPT aim at predicting next tokens, while autoencoding models such as BERT are trained on tasks such as predicting masked tokens. We train a decoder only architecture for predicting the second last token for a sequence of tokens. Our approach yields higher computational training efficiency than BERT-style models by employing a structured deterministic approach towards masking tokens. We use our model to improve the next token predictions of a standard GPT by combining both predictions in a ``generate-then-refine'' approach. We show on different variants of GPT-2 and different datasets that (not unexpectedly) second last token predictions are much more accurate, i.e., more than 15\% higher accuracy than ordinary next token predictors. The ``generate-then-refine'' approach also demonstrates notable improvements in next-token predictions, yielding smaller yet consistent and significant gains.