Simona Aracri is a researcher in the Institute of Marine Engineering at the National Research Council of Italy. Previously, she was a Post Doctoral Research Associate at the University of Edinburgh, working on the award winning project ORCA Hub and focusing on offshore robotic sensors. Her research uses innovative sensors and robotic platforms to push the boundaries of observational oceanography and environmental monitoring. She has spent more than 6 months at sea on oceanographic sampling campaigns, in the Mediterranean Sea, Pacific Ocean and the North Sea. Robot Talk is a weekly podcast that explores the exciting world of robotics, artificial intelligence and autonomous machines.

If the goal of a robot is to perform a function, then minimizing the possibility of failure is a top priority when it comes to robotic design. But this minimization is at odds with the robotic raison d'être: systems with multiple units, or agents, can perform more diverse functions, but they also have more different parts that can potentially fail. Researchers led by Jamie Paik, head of the Reconfigurable Robotics Laboratory ( RRL) in EPFL's School of Engineering, have not only circumvented this problem, but flipped it: they have designed a modular robot that actually lowers its odds of failure by sharing resources among its individual agents. "For the first time, we have found a way to reverse the trend of increasing odds of failure with increasing function," Paik explains. "We introduce local resource sharing as a new paradigm in robotics, reducing the failure rate with a larger number of modules."

Krystal Mattich leads global data governance, system security, and privacy compliance for Brain Corp: the world's leading autonomy platform for commercial robotics. As Senior Director of Security, Privacy, and Risk, she is the architect of the privacy-first infrastructure that powers over 40,000 BrainOS -enabled robots across retail, airports, education and logistics. Krystal played a central role in launching Brain Corp's public-facing Trust Center, reinforcing the company's commitment to data transparency, GDPR compliance, and responsible AI. Robot Talk is a weekly podcast that explores the exciting world of robotics, artificial intelligence and autonomous machines. Robot Talk is a weekly podcast that explores the exciting world of robotics, artificial intelligence and autonomous machines.

Neural Information Processing Systems http://nips.cc/

Neural Information Processing Systems http://nips.cc/

In this paper, we study the stochastic combinatorial multi-armed bandit (CMAB) framework that allows a general nonlinear reward function, whose expected value may not depend only on the means of the input random variables but possibly on the entire distributions of these variables. Our framework enables a much larger class of reward functions such as the max() function and nonlinear utility functions. Existing techniques relying on accurate estimations of the means of random variables, such as the upper confidence bound (UCB) technique, do not work directly on these functions. We propose a new algorithm called stochastically dominant confidence bound (SDCB), which estimates the distributions of underlying random variables and their stochastically dominant confidence bounds. We prove that SDCB can achieve O(log T) distribution-dependent regret and O( T) distribution-independent regret, where T is the time horizon. We apply our results to the K-MAX problem and expected utility maximization problems. In particular, for K-MAX, we provide the first polynomial-time approximation scheme (PTAS) for its offline problem, and give the first O( T) bound on the (1)-approximation regret of its online problem, for any > 0.

A cluster tree provides a highly-interpretable summary of a density function by representing the hierarchy of its high-density clusters. It is estimated using the empirical tree, which is the cluster tree constructed from a density estimator. This paper addresses the basic question of quantifying our uncertainty by assessing the statistical significance of topological features of an empirical cluster tree. We first study a variety of metrics that can be used to compare different trees, analyze their properties and assess their suitability for inference. We then propose methods to construct and summarize confidence sets for the unknown true cluster tree. We introduce a partial ordering on cluster trees which we use to prune some of the statistically insignificant features of the empirical tree, yielding interpretable and parsimonious cluster trees. Finally, we illustrate the proposed methods on a variety of synthetic examples and furthermore demonstrate their utility in the analysis of a Graft-versus-Host Disease (GvHD) data set.

Bayesian optimization is a prominent method for optimizing expensive-to-evaluate black-box functions that is widely applied to tuning the hyperparameters of machine learning algorithms. Despite its successes, the prototypical Bayesian optimization approach - using Gaussian process models - does not scale well to either many hyperparameters or many function evaluations. Attacking this lack of scalability and flexibility is thus one of the key challenges of the field. We present a general approach for using flexible parametric models (neural networks) for Bayesian optimization, staying as close to a truly Bayesian treatment as possible. We obtain scalability through stochastic gradient Hamiltonian Monte Carlo, whose robustness we improve via a scale adaptation.

Neural Information Processing Systems http://nips.cc/

Environment Animals Wildlife Endangered Species Earth's largest otters have chocolate bar-sized babies Chester Zoo celebrates the birth of giant otter triplets. 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. While they only weigh 7.1 ounces as babies, giant otters can grow to six-feet-long and weigh up to 71 pounds. Breakthroughs, discoveries, and DIY tips sent six days a week. It turns out that giant otter () newborns are actually quite small, weighing just around 7.1 ounces.