БЛОГ

Archive for the ‘information science’ category

Oct 13, 2024

Decoding algorithms for surface codes

Posted by in categories: computing, cosmology, information science, quantum physics

Now in Quantum: by Antonio deMarti iOlius, Patricio Fuentes, Román Orús, Pedro M. Crespo, and Josu Etxezarreta Martinez https://doi.org/10.22331/q-2024-10-10-1498


Antonio deMarti iOlius1, Patricio Fuentes2, Román Orús3,4,5, Pedro M. Crespo1, and Josu Etxezarreta Martinez1

1Department of Basic Sciences, Tecnun — University of Navarra, 20,018 San Sebastian, Spain. 2 Photonic Inc., Vancouver, British Columbia, Canada. 3 Multiverse Computing, Pio Baroja 37, 20008 San Sebastián, Spain 4 Donostia International Physics Center, Paseo Manuel de Lardizabal 4, 20018 San Sebastián, Spain 5 IKERBASQUE, Basque Foundation for Science, Plaza Euskadi 5, 48009 Bilbao, Spain.

Continue reading “Decoding algorithms for surface codes” »

Oct 13, 2024

Integer addition algorithm could reduce energy needs of AI by 95%

Posted by in categories: bitcoin, information science, robotics/AI

A team of engineers at AI inference technology company BitEnergy AI reports a method to reduce the energy needs of AI applications by 95%. The group has published a paper describing their new technique on the arXiv preprint server.

As AI applications have gone mainstream, their use has risen dramatically, leading to a notable rise in energy needs and costs. LLMs such as ChatGPT require a lot of computing power, which in turn means a lot of electricity is needed to run them.

As just one example, ChatGPT now requires roughly 564 MWh daily, or enough to power 18,000 American homes. As the science continues to advance and such apps become more popular, critics have suggested that AI applications might be using around 100 TWh annually in just a few years, on par with Bitcoin mining operations.

Oct 11, 2024

L-Mul algorithm breakthrough slashes AI energy consumption by 95%

Posted by in categories: information science, robotics/AI

Researchers have developed a new algorithm called L-Mul that could reduce AI energy consumption by up to 95%.

Oct 10, 2024

Overcoming ‘catastrophic forgetting’: Algorithm inspired by brain allows neural networks to retain knowledge

Posted by in categories: biological, information science, robotics/AI, transportation

Neural networks have a remarkable ability to learn specific tasks, such as identifying handwritten digits. However, these models often experience “catastrophic forgetting” when taught additional tasks: They can successfully learn the new assignments, but “forget” how to complete the original. For many artificial neural networks, like those that guide self-driving cars, learning additional tasks thus requires being fully reprogrammed.

Biological brains, on the other hand, are remarkably flexible. Humans and animals can easily learn how to play a new game, for instance, without having to re-learn how to walk and talk.

Inspired by the flexibility of human and animal brains, Caltech researchers have now developed a new type of that enables neural networks to be continuously updated with new data that they are able to learn from without having to start from scratch. The algorithm, called a functionally invariant path (FIP) algorithm, has wide-ranging applications from improving recommendations on online stores to fine-tuning self-driving cars.

Oct 10, 2024

New Algorithm Enables Neural Networks to Learn Continuously

Posted by in categories: biological, information science, robotics/AI, transportation

Neural networks have a remarkable ability to learn specific tasks, such as identifying handwritten digits. However, these models often experience “catastrophic forgetting” when taught additional tasks: They can successfully learn the new assignments, but “forget” how to complete the original. For many artificial neural networks, like those that guide self-driving cars, learning additional tasks thus requires being fully reprogrammed.

Biological brains, on the other hand, are remarkably flexible. Humans and animals can easily learn how to play a new game, for instance, without having to re-learn how to walk and talk.

Inspired by the flexibility of human and animal brains, Caltech researchers have now developed a new type of algorithm that enables neural networks to be continuously updated with new data that they are able to learn from without having to start from scratch. The algorithm, called a functionally invariant path (FIP) algorithm, has wide-ranging applications from improving recommendations on online stores to fine-tuning self-driving cars.

Oct 8, 2024

Quantum state tomography with locally purified density operators and local measurements

Posted by in categories: information science, quantum physics

Quantum state tomography plays a fundamental role in characterizing and evaluating the quality of quantum states produced by quantum devices. It serves as a crucial element in the advancement of quantum hardware and software, regardless of the underlying physical implementation and potential applications1,2,3. However, reconstructing the full quantum state becomes prohibitively expensive for large-scale quantum systems that exhibit potential quantum advantages4,5, as the number of measurements required increases exponentially with system size.

Recent protocols try to solve this challenge through two main steps: efficient parameterization of quantum states and utilization of carefully designed measurement schemes and classical data postprocessing algorithms. For one-dimensional (1D) systems with area law entanglement, the matrix product state (MPS)6,7,8,9,10,11,12 provides a compressed representation. It requires only a polynomial number of parameters that can be determined from local or global measurement results. Two iterative algorithms using local measurements, singular value thresholding (SVT)13 and maximum likelihood (ML)14, have been demonstrated in trapped-ion quantum simulators with up to 14 qubits15. However, SVT is limited to pure states and thus impractical for noisy intermediate-scale quantum (NISQ) systems. Meanwhile, although ML can handle mixed states represented as matrix product operators (MPOs)16,17, it suffers from inefficient classical data postprocessing.

Oct 8, 2024

Exploring the frontiers of neuromorphic engineering: A journey into brain-inspired computing

Posted by in categories: information science, nanotechnology, neuroscience, robotics/AI

Neuromorphic engineering is a cutting-edge field that focuses on developing computer hardware and software systems inspired by the structure, function, and behavior of the human brain. The ultimate goal is to create computing systems that are significantly more energy-efficient, scalable, and adaptive than conventional computer systems, capable of solving complex problems in a manner reminiscent of the brain’s approach.

This interdisciplinary field draws upon expertise from various domains, including neuroscience, computer science, electronics, nanotechnology, and materials science. Neuromorphic engineers strive to develop computer chips and systems incorporating artificial neurons and synapses, designed to process information in a parallel and distributed manner, akin to the brain’s functionality.

Key challenges in neuromorphic engineering encompass developing algorithms and hardware capable of performing intricate computations with minimal energy consumption, creating systems that can learn and adapt over time, and devising methods to control the behavior of artificial neurons and synapses in real-time.

Oct 7, 2024

New algorithm could reduce energy requirements of AI systems by up to 95 percent

Posted by in categories: information science, robotics/AI

Researchers have developed an algorithm that could dramatically reduce the energy consumption of artificial intelligence systems.

Ad.

Scientists at BitEnergy AI created a method called “Linear-complexity multiplication” (L-Mul) that replaces complex floating-point multiplications in AI models with simpler integer additions.

Oct 6, 2024

Researchers Say Quantum Machine Learning, Quantum Optimization Could Enhance The Design And Efficiency of Clinical Trials

Posted by in categories: biotech/medical, information science, quantum physics, robotics/AI

Despite the promising findings, the study acknowledges several limitations of quantum computing. One of the primary challenges is hardware noise, which can reduce the accuracy of quantum computations. Although error correction methods are improving, quantum computing has not yet reached the level of fault tolerance needed for widespread commercial use. Additionally, the study notes that while quantum computing has shown promise in PBPK/PD modeling and site selection, further research is needed to fully realize its potential in these areas.

Looking ahead, the study suggests several future directions for research. One of the key areas for improvement is the integration of quantum algorithms with existing clinical trial infrastructure. This will require collaboration between researchers, pharmaceutical companies and regulators to ensure that quantum computing can be effectively applied in real-world clinical settings. Additionally, the study calls for more work on developing quantum algorithms that can handle the inherent variability in biological data, particularly in genomics and personalized medicine.

The research was conducted by a team from several prominent institutions. Hakan Doga, Aritra Bose, and Laxmi Parida are from IBM Research and IBM Quantum. M. Emre Sahin is affiliated with The Hartree Centre, STFC, while Joao Bettencourt-Silva is based at IBM Research, Dublin, Ireland. Anh Pham, Eunyoung Kim, Anh Pham, Eunyoung Kim and Alan Andress are from Deloitte Consulting LLP. Sudhir Saxena and Radwa Soliman are from GNQ Insilico Inc. Jan Lukas Robertus is affiliated with Imperial College London and Royal Brompton and Harefield Hospitals and Hideaki Kawaguchi is from Keio University. Finally, Daniel Blankenberg is from the Lerner Research Institute, Cleveland Clinic.

Oct 5, 2024

Numerical simulation of deformable droplets in three-dimensional, complex-shaped microchannels

Posted by in categories: computing, information science, physics

The physics of drop motion in microchannels is fundamental to provide insights when designing applications of drop-based microfluidics. In this paper, we develop a boundary-integral method to simulate the motion of drops in microchannels of finite depth with flat walls and fixed depth but otherwise arbitrary geometries. To reduce computational time, we use a moving frame that follows the droplet throughout its motion. We provide a full description of the method, including our channel-meshing algorithm, which is a combination of Monte Carlo techniques and Delaunay triangulation, and compare our results to infinite-depth simulations. For regular geometries of uniform cross section, the infinite-depth limit is approached slowly with increasing depth, though we show much faster convergence by scaling with maximum vs average velocities. For non-regular channel geometries, features such as different branch heights can affect drop partitioning, breaking the symmetric behavior usually observed in regular geometries. Moreover, non-regular geometries also present challenges when comparing the results for deep and infinite-depth channels. To probe inertial effects on drop motion, the full Navier–Stokes equations are first solved for the entire channel, and the tabulated solution is then used as a boundary condition at the moving-frame surface for the Stokes flow inside the moving frame. For moderate Reynolds numbers up to Re = 5, inertial effects on the undisturbed flow are small even for more complex geometries, suggesting that inertial contributions in this range are likely small. This work provides an important tool for the design and analysis of three-dimensional droplet-based microfluidic devices.

Page 1 of 31812345678Last