pwc-archive/papers-with-abstracts huggingface dataset:
On Generating Transferable Targeted Perturbations
Authors: Muzammal Naseer, Salman Khan, Munawar Hayat, Fahad Shahbaz Khan, Fatih Porikli
Date: 2021-03-26 00:00:00
Proceeding: ICCV 2021 10

While the untargeted black-box transferability of adversarial perturbations has been extensively studied before, changing an unseen model's decisions to a specific `targeted' class remains a challenging feat. In this paper, we propose a new generative approach for highly transferable targeted perturbations (\ours). We note that the existing methods are less suitable for this task due to their reliance on class-boundary information that changes from one model to another, thus reducing transferability. In contrast, our approach matches the perturbed image `distribution' with that of the target class, leading to high targeted transferability rates. To this end, we propose a new objective function that not only aligns the global distributions of source and target images, but also matches the local neighbourhood structure between the two domains. Based on the proposed objective, we train a generator function that can adaptively synthesize perturbations specific to a given input. Our generative approach is independent of the source or target domain labels, while consistently performs well against state-of-the-art methods on a wide range of attack settings. As an example, we achieve $32.63\%$ target transferability from (an adversarially weak) VGG19$_{BN}$ to (a strong) WideResNet on ImageNet val. set, which is 4$\times$ higher than the previous best generative attack and 16$\times$ better than instance-specific iterative attack. Code is available at: {\small\url{https://github.com/Muzammal-Naseer/TTP}}.
A Practical Survey on Faster and Lighter Transformers
Authors: Quentin Fournier, Gaétan Marceau Caron, Daniel Aloise
Date: 2021-03-26 00:00:00
Tasks: Knowledge Distillation, Survey

Recurrent neural networks are effective models to process sequences. However, they are unable to learn long-term dependencies because of their inherent sequential nature. As a solution, Vaswani et al. introduced the Transformer, a model solely based on the attention mechanism that is able to relate any two positions of the input sequence, hence modelling arbitrary long dependencies. The Transformer has improved the state-of-the-art across numerous sequence modelling tasks. However, its effectiveness comes at the expense of a quadratic computational and memory complexity with respect to the sequence length, hindering its adoption. Fortunately, the deep learning community has always been interested in improving the models' efficiency, leading to a plethora of solutions such as parameter sharing, pruning, mixed-precision, and knowledge distillation. Recently, researchers have directly addressed the Transformer's limitation by designing lower-complexity alternatives such as the Longformer, Reformer, Linformer, and Performer. However, due to the wide range of solutions, it has become challenging for researchers and practitioners to determine which methods to apply in practice in order to meet the desired trade-off between capacity, computation, and memory. This survey addresses this issue by investigating popular approaches to make Transformers faster and lighter and by providing a comprehensive explanation of the methods' strengths, limitations, and underlying assumptions.
PAConv: Position Adaptive Convolution with Dynamic Kernel Assembling on Point Clouds
Authors: Mutian Xu, Runyu Ding, Hengshuang Zhao, Xiaojuan Qi
Date: 2021-03-26 00:00:00
Proceeding: CVPR 2021 1
Tasks: 3D Point Cloud Classification, Point Cloud Classification, Point Cloud Segmentation, Position

We introduce Position Adaptive Convolution (PAConv), a generic convolution operation for 3D point cloud processing. The key of PAConv is to construct the convolution kernel by dynamically assembling basic weight matrices stored in Weight Bank, where the coefficients of these weight matrices are self-adaptively learned from point positions through ScoreNet. In this way, the kernel is built in a data-driven manner, endowing PAConv with more flexibility than 2D convolutions to better handle the irregular and unordered point cloud data. Besides, the complexity of the learning process is reduced by combining weight matrices instead of brutally predicting kernels from point positions. Furthermore, different from the existing point convolution operators whose network architectures are often heavily engineered, we integrate our PAConv into classical MLP-based point cloud pipelines without changing network configurations. Even built on simple networks, our method still approaches or even surpasses the state-of-the-art models, and significantly improves baseline performance on both classification and segmentation tasks, yet with decent efficiency. Thorough ablation studies and visualizations are provided to understand PAConv. Code is released on https://github.com/CVMI-Lab/PAConv.
Visionary: Vision architecture discovery for robot learning
Authors: Iretiayo Akinola, Anelia Angelova, Yao Lu, Yevgen Chebotar, Dmitry Kalashnikov, Jacob Varley, Julian Ibarz, Michael S. Ryoo
Date: 2021-03-26 00:00:00
Tasks: Neural Architecture Search, Robot Manipulation

We propose a vision-based architecture search algorithm for robot manipulation learning, which discovers interactions between low dimension action inputs and high dimensional visual inputs. Our approach automatically designs architectures while training on the task - discovering novel ways of combining and attending image feature representations with actions as well as features from previous layers. The obtained new architectures demonstrate better task success rates, in some cases with a large margin, compared to a recent high performing baseline. Our real robot experiments also confirm that it improves grasping performance by 6%. This is the first approach to demonstrate a successful neural architecture search and attention connectivity search for a real-robot task.
Finite Element Reconstruction Of Stiffness Images In MR Elastography Using Statistical Physical Forward Modeling And Proximal Optimization Methods
Authors: Narges Mohammadi, Marvin M. Doyley, Mujdat Cetin
Date: 2021-03-26 00:00:00

Quantitative characterization of tissue properties, known as elasticity imaging, can be cast as solving an ill-posed inverse problem. The finite element methods (FEMs) in magnetic resonance elastography (MRE) imaging are based on solving a constrained optimization problem consisting of a physical forward model and a regularizer as the data-fidelity term and the prior term, respectively. In existing formulation for the elasticity forward model, physical laws that arise from equilibrium equation of harmonic motion, indicate a deterministic relationship between MRE-measured data and unknown elasticity distribution which leads to the poor and unstable elasticity distribution estimation in the presence of noise. Toward this end, we propose an efficient statistical methodology for physical forward model refinement by formulating it as linear algebraic representation with respect to the unknown elasticity distribution and incorporating an analytical noise model. To solve the subsequent total variation regularized optimization task, we benefit from a fixed-point scheme involving proximal gradient methods. Simulation results of elasticity reconstruction in various SNR conditions verify the effectiveness of the proposed approach.
Hybrid analysis and modeling, eclecticism, and multifidelity computing toward digital twin revolution
Authors: Omer San, Adil Rasheed, Trond Kvamsdal
Date: 2021-03-26 00:00:00

Most modeling approaches lie in either of the two categories: physics-based or data-driven. Recently, a third approach which is a combination of these deterministic and statistical models is emerging for scientific applications. To leverage these developments, our aim in this perspective paper is centered around exploring numerous principle concepts to address the challenges of (i) trustworthiness and generalizability in developing data-driven models to shed light on understanding the fundamental trade-offs in their accuracy and efficiency, and (ii) seamless integration of interface learning and multifidelity coupling approaches that transfer and represent information between different entities, particularly when different scales are governed by different physics, each operating on a different level of abstraction. Addressing these challenges could enable the revolution of digital twin technologies for scientific and engineering applications.
Dodrio: Exploring Transformer Models with Interactive Visualization
Authors: Zijie J. Wang, Robert Turko, Duen Horng Chau
Date: 2021-03-26 00:00:00
Proceeding: ACL 2021 5

Why do large pre-trained transformer-based models perform so well across a wide variety of NLP tasks? Recent research suggests the key may lie in multi-headed attention mechanism's ability to learn and represent linguistic information. Understanding how these models represent both syntactic and semantic knowledge is vital to investigate why they succeed and fail, what they have learned, and how they can improve. We present Dodrio, an open-source interactive visualization tool to help NLP researchers and practitioners analyze attention mechanisms in transformer-based models with linguistic knowledge. Dodrio tightly integrates an overview that summarizes the roles of different attention heads, and detailed views that help users compare attention weights with the syntactic structure and semantic information in the input text. To facilitate the visual comparison of attention weights and linguistic knowledge, Dodrio applies different graph visualization techniques to represent attention weights scalable to longer input text. Case studies highlight how Dodrio provides insights into understanding the attention mechanism in transformer-based models. Dodrio is available at https://poloclub.github.io/dodrio/.
Randomization-based Machine Learning in Renewable Energy Prediction Problems: Critical Literature Review, New Results and Perspectives
Authors: Javier Del Ser, David Casillas-Perez, Laura Cornejo-Bueno, Luis Prieto-Godino, Julia Sanz-Justo, Carlos Casanova-Mateo, Sancho Salcedo-Sanz
Date: 2021-03-26 00:00:00
Tasks: BIG-bench Machine Learning, Prediction

Randomization-based Machine Learning methods for prediction are currently a hot topic in Artificial Intelligence, due to their excellent performance in many prediction problems, with a bounded computation time. The application of randomization-based approaches to renewable energy prediction problems has been massive in the last few years, including many different types of randomization-based approaches, their hybridization with other techniques and also the description of new versions of classical randomization-based algorithms, including deep and ensemble approaches. In this paper we review the most important characteristics of randomization-based machine learning approaches and their application to renewable energy prediction problems. We describe the most important methods and algorithms of this family of modeling methods, and perform a critical literature review, examining prediction problems related to solar, wind, marine/ocean and hydro-power renewable sources. We support our critical analysis with an extensive experimental study, comprising real-world problems related to solar, wind and hydro-power energy, where randomization-based algorithms are found to achieve superior results at a significantly lower computational cost than other modeling counterparts. We end our survey with a prospect of the most important challenges and research directions that remain open this field, along with an outlook motivating further research efforts in this exciting research field.
LPV Modeling of Nonlinear Systems: A Multi-Path Feedback Linearization Approach
Authors: Hossam S. Abbas, Roland Tóth, Mihály Petreczky, Nader Meskin, Javad Mohammadpour Velni, Patrick J. W. Koelewijn
Date: 2021-03-26 00:00:00
Tasks: Scheduling

This paper introduces a systematic approach to synthesize linear parameter-varying (LPV) representations of nonlinear (NL) systems which are described by input affine state-space (SS) representations. The conversion approach results in LPV-SS representations in the observable canonical form. Based on the relative degree concept, first the SS description of a given NL representation is transformed to a normal form. In the SISO case, all nonlinearities of the original system are embedded into one NL function, which is factorized, based on a proposed algorithm, to construct an LPV representation of the original NL system. The overall procedure yields an LPV model in which the scheduling variable depends on the inputs and outputs of the system and their derivatives, achieving a practically applicable transformation of the model in case of low order derivatives. In addition, if the states of the NL model can be measured or estimated, then a modified procedure is proposed to provide LPV models scheduled by these states. Examples are included to demonstrate both approaches.
LiGCN: Label-interpretable Graph Convolutional Networks for Multi-label Text Classification
Authors: Irene Li, Aosong Feng, Hao Wu, Tianxiao Li, Toyotaro Suzumura, Ruihai Dong
Date: 2021-03-26 00:00:00
Proceeding: NAACL (DLG4NLP) 2022 7
Tasks: Classification, General Classification, Multi Label Text Classification, Multi-Label Text Classification, text-classification, Text Classification

Multi-label text classification (MLTC) is an attractive and challenging task in natural language processing (NLP). Compared with single-label text classification, MLTC has a wider range of applications in practice. In this paper, we propose a label-interpretable graph convolutional network model to solve the MLTC problem by modeling tokens and labels as nodes in a heterogeneous graph. In this way, we are able to take into account multiple relationships including token-level relationships. Besides, the model allows better interpretability for predicted labels as the token-label edges are exposed. We evaluate our method on four real-world datasets and it achieves competitive scores against selected baseline methods. Specifically, this model achieves a gain of 0.14 on the F1 score in the small label set MLTC, and 0.07 in the large label set scenario.
Inequality, Identity, and Partisanship: How redistribution can stem the tide of mass polarization
Authors: Alexander J. Stewart, Joshua B. Plotkin, Nolan McCarty
Date: 2021-03-26 00:00:00

The form of political polarization where citizens develop strongly negative attitudes towards out-party policies and members has become increasingly prominent across many democracies. Economic hardship and social inequality, as well as inter-group and racial conflict, have been identified as important contributing factors to this phenomenon known as "affective polarization." Such partisan animosities are exacerbated when these interests and identities become aligned with existing party cleavages. In this paper we use a model of cultural evolution to study how these forces combine to generate and maintain affective political polarization. We show that economic events can drive both affective polarization and sorting of group identities along party lines, which in turn can magnify the effects of underlying inequality between those groups. But on a more optimistic note, we show that sufficiently high levels of wealth redistribution through the provision of public goods can counteract this feedback and limit the rise of polarization. We test some of our key theoretical predictions using survey data on inter-group polarization, sorting of racial groups and affective polarization in the United States over the past 50 years.
Training a Task-Specific Image Reconstruction Loss
Authors: Aamir Mustafa, Aliaksei Mikhailiuk, Dan Andrei Iliescu, Varun Babbar, Rafal K. Mantiuk
Date: 2021-03-26 00:00:00
Tasks: Denoising, Image Reconstruction, Image Restoration, Image Super-Resolution, JPEG Artifact Removal, Super-Resolution

The choice of a loss function is an important factor when training neural networks for image restoration problems, such as single image super resolution. The loss function should encourage natural and perceptually pleasing results. A popular choice for a loss is a pre-trained network, such as VGG, which is used as a feature extractor for computing the difference between restored and reference images. However, such an approach has multiple drawbacks: it is computationally expensive, requires regularization and hyper-parameter tuning, and involves a large network trained on an unrelated task. Furthermore, it has been observed that there is no single loss function that works best across all applications and across different datasets. In this work, we instead propose to train a set of loss functions that are application specific in nature. Our loss function comprises a series of discriminators that are trained to detect and penalize the presence of application-specific artifacts. We show that a single natural image and corresponding distortions are sufficient to train our feature extractor that outperforms state-of-the-art loss functions in applications like single image super resolution, denoising, and JPEG artifact removal. Finally, we conclude that an effective loss function does not have to be a good predictor of perceived image quality, but instead needs to be specialized in identifying the distortions for a given restoration method.
SKID RAW: Skill Discovery from Raw Trajectories
Authors: Daniel Tanneberg, Kai Ploeger, Elmar Rueckert, Jan Peters
Date: 2021-03-26 00:00:00
Tasks: Variational Inference

Integrating robots in complex everyday environments requires a multitude of problems to be solved. One crucial feature among those is to equip robots with a mechanism for teaching them a new task in an easy and natural way. When teaching tasks that involve sequences of different skills, with varying order and number of these skills, it is desirable to only demonstrate full task executions instead of all individual skills. For this purpose, we propose a novel approach that simultaneously learns to segment trajectories into reoccurring patterns and the skills to reconstruct these patterns from unlabelled demonstrations without further supervision. Moreover, the approach learns a skill conditioning that can be used to understand possible sequences of skills, a practical mechanism to be used in, for example, human-robot-interactions for a more intelligent and adaptive robot behaviour. The Bayesian and variational inference based approach is evaluated on synthetic and real human demonstrations with varying complexities and dimensionality, showing the successful learning of segmentations and skill libraries from unlabelled data.
On UMAP's true loss function
Authors: Sebastian Damrich, Fred A. Hamprecht
Date: 2021-03-26 00:00:00
Proceeding: NeurIPS 2021 12

UMAP has supplanted t-SNE as state-of-the-art for visualizing high-dimensional datasets in many disciplines, but the reason for its success is not well understood. In this work, we investigate UMAP's sampling based optimization scheme in detail. We derive UMAP's effective loss function in closed form and find that it differs from the published one. As a consequence, we show that UMAP does not aim to reproduce its theoretically motivated high-dimensional UMAP similarities. Instead, it tries to reproduce similarities that only encode the shared $k$ nearest neighbor graph, thereby challenging the previous understanding of UMAP's effectiveness. Instead, we claim that the key to UMAP's success is its implicit balancing of attraction and repulsion resulting from negative sampling. This balancing in turn facilitates optimization via gradient descent. We corroborate our theoretical findings on toy and single cell RNA sequencing data.
A Convex Programming Approach to Data-Driven Risk-Averse Reinforcement Learning
Authors: Yuzhen Han, Majid Mazouchi, Subramanya Nageshrao, Hamidreza Modares
Date: 2021-03-26 00:00:00
Tasks: reinforcement-learning, Reinforcement Learning (RL)

This paper presents a model-free reinforcement learning (RL) algorithm to solve the risk-averse optimal control (RAOC) problem for discrete-time nonlinear systems. While successful RL algorithms have been presented to learn optimal control solutions under epistemic uncertainties (i.e., lack of knowledge of system dynamics), they do so by optimizing the expected utility of outcomes, which ignores the variance of cost under aleatory uncertainties (i.e., randomness). Performance-critical systems, however, must not only optimize the expected performance, but also reduce its variance to avoid performance fluctuation during RL's course of operation. To solve the RAOC problem, this paper presents the following three variants of RL algorithms and analyze their advantages and preferences for different situations/systems: 1) a one-shot static convex program -based RL, 2) an iterative value iteration (VI) algorithm that solves a linear programming (LP) optimization at each iteration, and 3) an iterative policy iteration (PI) algorithm that solves a convex optimization at each iteration and guarantees the stability of the consecutive control policies. Convergence of the exact optimization problems, which are infinite-dimensional in all three cases, to the optimal risk-averse value function is shown. To turn these optimization problems into standard optimization problems with finite decision variables and constraints, function approximation for value estimations as well as constraint sampling are leveraged. Data-driven implementations of these algorithms are provided based on Q-function which enables learning the optimal value without any knowledge of the system dynamics. The performance of the approximated solutions is also verified through a weighted sup-norm bound and the Lyapunov bound. A simulation example is provided to verify the effectiveness of the presented approach.
Predicting Demand for Air Taxi Urban Aviation Services using Machine Learning Algorithms
Authors: Suchithra Rajendran, Sharan Srinivas, Trenton Grimshaw
Date: 2021-03-26 00:00:00
Tasks: BIG-bench Machine Learning, regression

This research focuses on predicting the demand for air taxi urban air mobility (UAM) services during different times of the day in various geographic regions of New York City using machine learning algorithms (MLAs). Several ride-related factors (such as month of the year, day of the week and time of the day) and weather-related variables (such as temperature, weather conditions and visibility) are used as predictors for four popular MLAs, namely, logistic regression, artificial neural networks, random forests, and gradient boosting. Experimental results suggest gradient boosting to consistently provide higher prediction performance. Specific locations, certain time periods and weekdays consistently emerged as critical predictors.
Data Quality as Predictor of Voice Anti-Spoofing Generalization
Authors: Bhusan Chettri, Rosa González Hautamäki, Md Sahidullah, Tomi Kinnunen
Date: 2021-03-26 00:00:00
Tasks: Voice Anti-spoofing

Voice anti-spoofing aims at classifying a given utterance either as a bonafide human sample, or a spoofing attack (e.g. synthetic or replayed sample). Many anti-spoofing methods have been proposed but most of them fail to generalize across domains (corpora) -- and we do not know \emph{why}. We outline a novel interpretative framework for gauging the impact of data quality upon anti-spoofing performance. Our within- and between-domain experiments pool data from seven public corpora and three anti-spoofing methods based on Gaussian mixture and convolutive neural network models. We assess the impacts of long-term spectral information, speaker population (through x-vector speaker embeddings), signal-to-noise ratio, and selected voice quality features.