Energy
#325: The Advantage of Fins, with Benjamin Pietro Filardo
At PES, they developed a novel form of actuation using two undulating fins on a robot. These fins present multiple benefits over traditional propeller systems including excellent energy efficiency, low water turbulence, and an ability to maneuver in water, land, and ice. Aside from its benefits on a robot, Pietro also talks about its advantages for harnessing energy from moving water. Benjamin "Pietro" Filardo After several years in the architectural profession, Pietro founded Pliant Energy Systems to explore renewable energy concepts he first pondered while earning his first degree in marine biology and oceanography. With funding from four federal agencies he has broadened the application of these concepts into marine propulsion and a highly novel robotics platform.
Forbes features HU student research - Harrisburg University
An HU Analytics Ph.D. student's research paper, recently named "Best Overall Paper" at the Tackling Climate Change with Machine Learning workshop at the NeurIPS2020 Conference, has been featured on Forbes.com. In the article, "A.I. needs to get real--and other takeaways from this year's NeurIPS," author Jeremy Kahn notes that (HU Analytics Ph.D. student) Lyra Wang and her collaborators have teamed "to create a machine learning system to automatically predict areas of oil and natural gas drilling sites that are likely to leak methane, the heat trapping gas that is 84 times more potent than carbon dioxide and a major contributor to global warming." Wang's paper, titled "A Machine Learning Approach to Methane Emissions Mitigation in the Oil and Gas Industry," in a section of the article titled, "An Eye of AI Research." To view the article, visit this link. Accredited by the Middle States Commission on Higher Education, Harrisburg University is a private non-profit university offering bachelor and graduate degree programs in science, technology, and math fields to a diverse student body.
It takes a lot of energy for machines to learn โ here's why AI is so power-hungry
This month, Google forced out a prominent AI ethics researcher after she voiced frustration with the company for making her withdraw a research paper. The paper pointed out the risks of language-processing artificial intelligence, the type used in Google Search and other text analysis products. Among the risks is the large carbon footprint of developing this kind of AI technology. By some estimates, training an AI model generates as much carbon emissions as it takes to build and drive five cars over their lifetimes. I am a researcher who studies and develops AI models, and I am all too familiar with the skyrocketing energy and financial costs of AI research.
TEMImageNet and AtomSegNet Deep Learning Training Library and Models for High-Precision Atom Segmentation, Localization, Denoising, and Super-resolution Processing of Atom-Resolution Scanning TEM Images
Lin, Ruoqian, Zhang, Rui, Wang, Chunyang, Yang, Xiao-Qing, Xin, Huolin L.
Atom segmentation and localization, noise reduction and super-resolution processing of atomic-resolution scanning transmission electron microscopy (STEM) images with high precision and robustness is a challenging task. Although several conventional algorithms, such has thresholding, edge detection and clustering, can achieve reasonable performance in some predefined sceneries, they tend to fail when interferences from the background are strong and unpredictable. Particularly, for atomic-resolution STEM images, so far there is no well-established algorithm that is robust enough to segment or detect all atomic columns when there is large thickness variation in a recorded image. Herein, we report the development of a training library and a deep learning method that can perform robust and precise atom segmentation, localization, denoising, and super-resolution processing of experimental images. Despite using simulated images as training datasets, the deep-learning model can self-adapt to experimental STEM images and shows outstanding performance in atom detection and localization in challenging contrast conditions and the precision is consistently better than the state-of-the-art two-dimensional Gaussian fit method. Taking a step further, we have deployed our deep-learning models to a desktop app with a graphical user interface and the app is free and open-source. We have also built a TEM ImageNet project website for easy browsing and downloading of the training data.
Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting
Zhou, Haoyi, Zhang, Shanghang, Peng, Jieqi, Zhang, Shuai, Li, Jianxin, Xiong, Hui, Zhang, Wancai
Many real-world applications require the prediction of long sequence time-series, such as electricity consumption planning. Long sequence time-series forecasting (LSTF) demands a high prediction capacity of the model, which is the ability to capture precise long-range dependency coupling between output and input efficiently. Recent studies have shown the potential of Transformer to increase the prediction capacity. However, there are several severe issues with Transformer that prevent it from being directly applicable to LSTF, such as quadratic time complexity, high memory usage, and inherent limitation of the encoder-decoder architecture. To address these issues, we design an efficient transformer-based model for LSTF, named Informer, with three distinctive characteristics: (i) a $ProbSparse$ Self-attention mechanism, which achieves $O(L \log L)$ in time complexity and memory usage, and has comparable performance on sequences' dependency alignment. (ii) the self-attention distilling highlights dominating attention by halving cascading layer input, and efficiently handles extreme long input sequences. (iii) the generative style decoder, while conceptually simple, predicts the long time-series sequences at one forward operation rather than a step-by-step way, which drastically improves the inference speed of long-sequence predictions. Extensive experiments on four large-scale datasets demonstrate that Informer significantly outperforms existing methods and provides a new solution to the LSTF problem.
Variational Quantum Algorithms
Cerezo, M., Arrasmith, Andrew, Babbush, Ryan, Benjamin, Simon C., Endo, Suguru, Fujii, Keisuke, McClean, Jarrod R., Mitarai, Kosuke, Yuan, Xiao, Cincio, Lukasz, Coles, Patrick J.
Applications such as simulating large quantum systems or solving large-scale linear algebra problems are immensely challenging for classical computers due their extremely high computational cost. Quantum computers promise to unlock these applications, although fault-tolerant quantum computers will likely not be available for several years. Currently available quantum devices have serious constraints, including limited qubit numbers and noise processes that limit circuit depth. Variational Quantum Algorithms (VQAs), which employ a classical optimizer to train a parametrized quantum circuit, have emerged as a leading strategy to address these constraints. VQAs have now been proposed for essentially all applications that researchers have envisioned for quantum computers, and they appear to the best hope for obtaining quantum advantage. Nevertheless, challenges remain including the trainability, accuracy, and efficiency of VQAs. In this review article we present an overview of the field of VQAs. Furthermore, we discuss strategies to overcome their challenges as well as the exciting prospects for using them as a means to obtain quantum advantage.
On $O( \max \{n_1, n_2 \}\log ( \max \{ n_1, n_2 \} n_3) )$ Sample Entries for $n_1 \times n_2 \times n_3$ Tensor Completion via Unitary Transformation
Song, Guang-Jing, Ng, Michael K., Zhang, Xiongjun
One of the key problems in tensor completion is the number of uniformly random sample entries required for recovery guarantee. The main aim of this paper is to study $n_1 \times n_2 \times n_3$ third-order tensor completion and investigate into incoherence conditions of $n_3$ low-rank $n_1$-by-$n_2$ matrix slices under the transformed tensor singular value decomposition where the unitary transformation is applied along $n_3$-dimension. We show that such low-rank tensors can be recovered exactly with high probability when the number of randomly observed entries is of order $O( r\max \{n_1, n_2 \} \log ( \max \{ n_1, n_2 \} n_3))$, where $r$ is the sum of the ranks of these $n_3$ matrix slices in the transformed tensor. By utilizing synthetic data and imaging data sets, we demonstrate that the theoretical result can be obtained under valid incoherence conditions, and the tensor completion performance of the proposed method is also better than that of existing methods in terms of sample sizes requirement.
Preparing for emergency response with partial network information
Natural disasters cause considerable economic damage, loss of life, and network disruptions each year. As emergency response and infrastructure systems are interdependent and interconnected, quick assessment and repair in the event of disruption is critical. School of Computational Science and Engineering (CSE) Associate Professor B. Aditya Prakash is leading a collaborative effort with researchers from Georgia Institute of Technology, University of Oklahoma, University of Iowa, and University of Virginia to determine the state of an infrastructure network during such a disruption. Prakash's group has also been collaborating closely with the Oak Ridge National Laboratory on such problems in critical infrastructure networks. However, according to Prakash, quickly determining which infrastructure components are damaged in the event of a disaster is not easily done after a disruption.
NeurIPS 2020
Climate change is one of the greatest threats humans have ever faced, with increasingly severe consequences feared as sea levels rise, ecosystems falter, and natural disasters multiply. Tackling climate change is a huge and complex challenge, where it's hoped that AI-powered efforts can play an equally huge and beneficial role. Organizers of NeurIPS 2020 (Conference on Neural Information Processing Systems) see machine learning (ML) as an invaluable tool in the fight against climate change. A wide array of applications and techniques are already being explored, from smart electric grid design to satellite-tracking of greenhouse gas emissions and countless others. Last Friday, NeurIPS 2020 partnered with Climate Change AI (CCAI) -- an organization of researchers, engineers, entrepreneurs, investors, policymakers, companies and NGOs aiming to catalyze impactful work at the intersection of climate change and machine learning -- to host the Tackling Climate Change with ML Workshop, which explored how the ML community could collaborate with other fields and practitioners in this fight. The all-virtual format of NeurIPS 2020, which ran December 6-12, provided a unique opportunity to foster cross-pollination between ML researchers and experts across diverse fields.
Semantic Annotation for Tabular Data
Khurana, Udayan, Galhotra, Sainyam
Detecting semantic concept of columns in tabular data is of particular interest to many applications ranging from data integration, cleaning, search to feature engineering and model building in machine learning. Recently, several works have proposed supervised learning-based or heuristic pattern-based approaches to semantic type annotation. Both have shortcomings that prevent them from generalizing over a large number of concepts or examples. Many neural network based methods also present scalability issues. Additionally, none of the known methods works well for numerical data. We propose $C^2$, a column to concept mapper that is based on a maximum likelihood estimation approach through ensembles. It is able to effectively utilize vast amounts of, albeit somewhat noisy, openly available table corpora in addition to two popular knowledge graphs to perform effective and efficient concept prediction for structured data. We demonstrate the effectiveness of $C^2$ over available techniques on 9 datasets, the most comprehensive comparison on this topic so far.