pwc-archive/papers-with-abstracts huggingface dataset:
A Gentle Introduction to Scaling Laws in Biological Systems
Authors: Fabiano L. Ribeiro, William R. L. S. Pereira
Date: 2021-05-04 00:00:00

This paper investigates the role of size in biological organisms. More specifically, how the energy demand, expressed by the metabolic rate, changes according to the mass of an organism. Empirical evidence suggests a power-law relation between mass and metabolic rate, namely allometric law. For vascular organisms, the exponent $\beta$ of this power-law is smaller than one, which implies scaling economy; that is, the greater the organism is, the lesser energy per cell it demands. However, the numerical value of this exponent is a theme of an extensive debate and a central issue in comparative physiology. It is presented in this work some empirical data and a detailed discussion about the most successful theories to explain these issues. A historical perspective is also shown, beginning with the first empirical insights in the sec. 19 about scaling properties in biology, passing through the two more important theories that explain the scaling properties quantitatively. Firstly, the Rubner model, that consider organism surface area and heat dissipation to derive $\beta = 2/3$. Secondly, the West-Brown-Enquist theory, that explains such scaling properties as a consequence of the hierarchical and fractal nutrient distribution network, deriving $\beta = 3/4$.
Optimizing Area Under the Curve Measures via Matrix Factorization for Predicting Drug-Target Interaction with Multiple Similarities
Authors: Bin Liu, Grigorios Tsoumakas
Date: 2021-05-01 00:00:00
Tasks: Drug Discovery, Prediction

In drug discovery, identifying drug-target interactions (DTIs) via experimental approaches is a tedious and expensive procedure. Computational methods efficiently predict DTIs and recommend a small part of potential interacting pairs for further experimental confirmation, accelerating the drug discovery process. Although it has been shown that fusing heterogeneous drug and target similarities can improve the prediction ability, the existing similarity combination methods ignore the interaction consistency for neighbour entities which is more crucial for the DTI prediction model. Furthermore, area under the precision-recall curve (AUPR) that emphasizes the accuracy of top-ranked pairs and area under the receiver operating characteristic curve (AUC) that heavily punishes the existence of low ranked interacting pairs are two widely used evaluation metrics in DTI prediction. However, the two metrics are seldom considered as losses within existing DTI prediction methods. This paper first proposes two matrix factorization (MF) methods that optimize AUPR and AUC using convex surrogate losses respectively, and then develops an ensemble MF approach takes advantage of the two area under the curve metrics by combining the two single metric based MF models. Both three proposed approaches incorporate a novel local interaction consistency aware similarity interaction method to generate fused drug and target similarities that preserve vital information from the more reliable view. Experimental results over five datasets under different prediction settings show that the proposed methods outperform various competitors in terms of the metric(s) they optimize. In addition, the validation on the top ranked novel predictions confirms the ability of our methods to discover potential new DTIs.
Why and how systematic strategies decay
Authors: Antoine Falck, Adam Rej, David Thesmar
Date: 2021-05-04 00:00:00

In this paper, we propose ex-ante characteristics that predict the drop in risk-adjusted performance out-of-sample for a large set of stock anomalies published in finance and accounting academic journals. Our set of predictors is generated by hypotheses of OOS decay put forward by McLean and Pontiff (2016): arbitrage capital flowing into newly published strategies and in-sample overfitting linked to multiple hypothesis testing. The year of publication alone - compatible with both hypotheses - explains 30% of the variance of Sharpe decay across factors: Every year, the Sharpe decay of newly-published factors increases by 5ppt. The other important variables are directly related to overfitting: the number of operations required to calculate the signal and two measures of sensitivity of in-sample Sharpe to outliers together add another 15% of explanatory power. Some arbitrage-related variables are statistically significant, but their predictive power is marginal.
Learning the Evolution of the Universe in N-body Simulations
Authors: Chang Chen, Yin Li, Francisco Villaescusa-Navarro, Shirley Ho, Anthony Pullen
Date: 2020-12-10 00:00:00

Understanding the physics of large cosmological surveys down to small (nonlinear) scales will significantly improve our knowledge of the Universe. Large N-body simulations have been built to obtain predictions in the non-linear regime. However, N-body simulations are computationally expensive and generate large amount of data, putting burdens on storage. These data are snapshots of the simulated Universe at different times, and fine sampling is necessary to accurately save its whole history. We employ a deep neural network model to predict the nonlinear N-body simulation at an intermediate time step given two widely separated snapshots. Our results outperform the cubic Hermite interpolation benchmark method in interpolating N-body simulations. This work can greatly reduce the storage requirement and allow us to reconstruct the cosmic history from far fewer snapshots of the universe.
Quantifying the Economic Impact of COVID-19 in Mainland China Using Human Mobility Data
Authors: Jizhou Huang, Haifeng Wang, Haoyi Xiong, Miao Fan, An Zhuo, Ying Li, Dejing Dou
Date: 2020-05-06 00:00:00

To contain the pandemic of coronavirus (COVID-19) in Mainland China, the authorities have put in place a series of measures, including quarantines, social distancing, and travel restrictions. While these strategies have effectively dealt with the critical situations of outbreaks, the combination of the pandemic and mobility controls has slowed China's economic growth, resulting in the first quarterly decline of Gross Domestic Product (GDP) since GDP began to be calculated, in 1992. To characterize the potential shrinkage of the domestic economy, from the perspective of mobility, we propose two new economic indicators: the New Venues Created (NVC) and the Volumes of Visits to Venue (V^3), as the complementary measures to domestic investments and consumption activities, using the data of Baidu Maps. The historical records of these two indicators demonstrated strong correlations with the past figures of Chinese GDP, while the status quo has dramatically changed this year, due to the pandemic. We hereby presented a quantitative analysis to project the impact of the pandemic on economies, using the recent trends of NVC and V^3. We found that the most affected sectors would be travel-dependent businesses, such as hotels, educational institutes, and public transportation, while the sectors that are mandatory to human life, such as workplaces, residential areas, restaurants, and shopping sites, have been recovering rapidly. Analysis at the provincial level showed that the self-sufficient and self-sustainable economic regions, with internal supplies, production, and consumption, have recovered faster than those regions relying on global supply chains.
DepthNet: Real-Time LiDAR Point Cloud Depth Completion for Autonomous Vehicles
Authors: Lin Bai, Yiming Zhao, Mahdi Elhousni, Xinming Huang
Date: 2020-07-05 00:00:00
Tasks: Autonomous Driving, Autonomous Vehicles, Depth Completion

Autonomous vehicles rely heavily on sensors such as camera and LiDAR, which provide real-time information about their surroundings for the tasks of perception, planning and control. Typically a LiDAR can only provide sparse point cloud owing to a limited number of scanning lines. By employing depth completion, a dense depth map can be generated by assigning each camera pixel a corresponding depth value. However, the existing depth completion convolutional neural networks are very complex that requires high-end GPUs for processing, and thus they are not applicable to real-time autonomous driving. In this paper, a light-weight network is proposed for the task of LiDAR point cloud depth completion. With an astonishing 96.2% reduction in the number of parameters, it still achieves comparable performance (9.3% better in MAE but 3.9% worse in RMSE) to the state-of-the-art network. For real-time embedded platforms, depthwise separable technique is applied to both convolution and deconvolution operations and the number of parameters decreases further by a factor of 7.3, with only a small percentage increase in RMSE and MAE performance. Moreover, a system-on-chip architecture for depth completion is developed on a PYNQ-based FPGA platform that achieves real-time processing for HDL-64E LiDAR at the speed 11.1 frame per second.
VEXAS: VISTA EXtension to Auxiliary Surveys - Data Release 2. Machine-learning based classification of sources in the Southern Hemisphere
Authors: V. Khramtsov, C. Spiniello, A. Agnello, A. Sergeyev
Date: 2021-03-18 00:00:00
Tasks: Imputation, Survey

We present the second public data release (DR) of the VISTA EXtension to Auxiliary Surveys (VEXAS), where we classify objects into stars, galaxies and quasars based on an ensemble of machine learning algorithms. The aim of VEXAS is to build the widest multi-wavelength catalogue, providing reference magnitudes, colours and morphological information for a large number of scientific uses. We apply an ensemble of 32 different machine learning models, based on three different algorithms and on different magnitude sets, training samples and classification problems on the three VEXAS DR1 optical+infrared (IR) tables. The tables were created in DR1 cross-matching VISTA near-IR data with WISE far-IR data and with optical magnitudes from the Dark Energy Survey (VEXAS-DESW), the Sky Mapper Survey (VEXAS-SMW), and the PanSTARRS (VEXAS-PSW). We assemble a large table of spectroscopically confirmed objects (415 628 unique objects), based on the combination of 6 different spectroscopic surveys that we use for training. We develop feature imputation to classify also objects for which magnitudes in one or more bands are missing. We classify in total ~90 million objects in the Southern Hemisphere. Among these, ~62.9M (~52.6M) are classified as 'high confidence' ('secure') stars, ~920k (~750k) as 'high confidence' ('secure') quasars and ~34.8M (~34.1M) as 'high confidence' ('secure') galaxies, with probabilities pclass≥0.7 (pclass≥0.9). The density of high-confidence extragalactic objects varies strongly with the survey depth: at pclass≥0.7, there are 111/deg2 quasars in the VEXAS-DESW footprint and 103/deg2 in the VEXAS-PSW footprint, while only 10.7/deg2 in the VEXAS-SM footprint. Improved depth in the mid-IR and coverage in the optical and near-IR are needed for the SM footprint that is not already covered by DESW and PSW.
Retrieving Complex Tables with Multi-Granular Graph Representation Learning
Authors: Fei Wang, Kexuan Sun, Muhao Chen, Jay Pujara, Pedro Szekely
Date: 2021-05-04 00:00:00
Tasks: Graph Representation Learning, Natural Language Queries, Representation Learning, Retrieval, Table Retrieval, Table Search

The task of natural language table retrieval (NLTR) seeks to retrieve semantically relevant tables based on natural language queries. Existing learning systems for this task often treat tables as plain text based on the assumption that tables are structured as dataframes. However, tables can have complex layouts which indicate diverse dependencies between subtable structures, such as nested headers. As a result, queries may refer to different spans of relevant content that is distributed across these structures. Moreover, such systems fail to generalize to novel scenarios beyond those seen in the training set. Prior methods are still distant from a generalizable solution to the NLTR problem, as they fall short in handling complex table layouts or queries over multiple granularities. To address these issues, we propose Graph-based Table Retrieval (GTR), a generalizable NLTR framework with multi-granular graph representation learning. In our framework, a table is first converted into a tabular graph, with cell nodes, row nodes and column nodes to capture content at different granularities. Then the tabular graph is input to a Graph Transformer model that can capture both table cell content and the layout structures. To enhance the robustness and generalizability of the model, we further incorporate a self-supervised pre-training task based on graph-context matching. Experimental results on two benchmarks show that our method leads to significant improvements over the current state-of-the-art systems. Further experiments demonstrate promising performance of our method on cross-dataset generalization, and enhanced capability of handling complex tables and fulfilling diverse query intents. Code and data are available at https://github.com/FeiWang96/GTR.
A Robotic Approach towards Quantifying Epipelagic Bound Plastic Using Deep Visual Models
Authors: Gautam Tata, Sarah-Jeanne Royer, Olivier Poirion, Jay Lowe
Date: 2021-05-05 00:00:00
Tasks: Object Detection

The quantification of positively buoyant marine plastic debris is critical to understanding how plastic litter accumulates across the world's oceans and is also crucial to identifying hotspots for targeted cleanup efforts. Currently, the most common method to quantify marine plastic is using manta trawls for manual sampling. However, this method is cost-intensive and requires human labor. This study removes the need for manual sampling by using an autonomous method using neural networks and computer vision models, which trained on images captured from various layers of the ocean column to perform real-time plastic quantification. The best performing model has a Mean Average Precision of 85% and an F1-Score of 0.89 while maintaining near real-time processing speeds ~2 ms/img.
Training Structured Mechanical Models by Minimizing Discrete Euler-Lagrange Residual
Authors: Kunal Menda, Jayesh K. Gupta, Zachary Manchester, Mykel J. Kochenderfer
Date: 2021-05-05 00:00:00
Tasks: Decision Making, Time Series, Time Series Analysis

Model-based paradigms for decision-making and control are becoming ubiquitous in robotics. They rely on the ability to efficiently learn a model of the system from data. Structured Mechanical Models (SMMs) are a data-efficient black-box parameterization of mechanical systems, typically fit to data by minimizing the error between predicted and observed accelerations or next states. In this work, we propose a methodology for fitting SMMs to data by minimizing the discrete Euler-Lagrange residual. To study our methodology, we fit models to joint-angle time-series from undamped and damped double-pendulums, studying the quality of learned models fit to data with and without observation noise. Experiments show that our methodology learns models that are better in accuracy to those of the conventional schemes for fitting SMMs. We identify use cases in which our method is a more appropriate methodology. Source code for reproducing the experiments is available at https://github.com/sisl/delsmm.
Nonparametric Trace Regression in High Dimensions via Sign Series Representation
Authors: Chanwoo Lee, Lexin Li, Hao Helen Zhang, Miaoyan Wang
Date: 2021-05-04 00:00:00
Tasks: compressed sensing, Matrix Completion, Multi-Task Learning, regression, Vocal Bursts Intensity Prediction

Learning of matrix-valued data has recently surged in a range of scientific and business applications. Trace regression is a widely used method to model effects of matrix predictors and has shown great success in matrix learning. However, nearly all existing trace regression solutions rely on two assumptions: (i) a known functional form of the conditional mean, and (ii) a global low-rank structure in the entire range of the regression function, both of which may be violated in practice. In this article, we relax these assumptions by developing a general framework for nonparametric trace regression models via structured sign series representations of high dimensional functions. The new model embraces both linear and nonlinear trace effects, and enjoys rank invariance to order-preserving transformations of the response. In the context of matrix completion, our framework leads to a substantially richer model based on what we coin as the "sign rank" of a matrix. We show that the sign series can be statistically characterized by weighted classification tasks. Based on this connection, we propose a learning reduction approach to learn the regression model via a series of classifiers, and develop a parallelable computation algorithm to implement sign series aggregations. We establish the excess risk bounds, estimation error rates, and sample complexities. Our proposal provides a broad nonparametric paradigm to many important matrix learning problems, including matrix regression, matrix completion, multi-task learning, and compressed sensing. We demonstrate the advantages of our method through simulations and two applications, one on brain connectivity study and the other on high-rank image completion.
Sampling From the Wasserstein Barycenter
Authors: Chiheb Daaloul, Thibaut Le Gouic, Jacques Liandrat, Magali Tournus
Date: 2021-05-04 00:00:00

This work presents an algorithm to sample from the Wasserstein barycenter of absolutely continuous measures. Our method is based on the gradient flow of the multimarginal formulation of the Wasserstein barycenter, with an additive penalization to account for the marginal constraints. We prove that the minimum of this penalized multimarginal formulation is achieved for a coupling that is close to the Wasserstein barycenter. The performances of the algorithm are showcased in several settings.
Preference learning along multiple criteria: A game-theoretic perspective
Authors: Kush Bhatia, Ashwin Pananjady, Peter L. Bartlett, Anca D. Dragan, Martin J. Wainwright
Date: 2021-05-05 00:00:00
Proceeding: NeurIPS 2020 12
Tasks: Autonomous Driving

The literature on ranking from ordinal data is vast, and there are several ways to aggregate overall preferences from pairwise comparisons between objects. In particular, it is well known that any Nash equilibrium of the zero sum game induced by the preference matrix defines a natural solution concept (winning distribution over objects) known as a von Neumann winner. Many real-world problems, however, are inevitably multi-criteria, with different pairwise preferences governing the different criteria. In this work, we generalize the notion of a von Neumann winner to the multi-criteria setting by taking inspiration from Blackwell's approachability. Our framework allows for non-linear aggregation of preferences across criteria, and generalizes the linearization-based approach from multi-objective optimization. From a theoretical standpoint, we show that the Blackwell winner of a multi-criteria problem instance can be computed as the solution to a convex optimization problem. Furthermore, given random samples of pairwise comparisons, we show that a simple plug-in estimator achieves near-optimal minimax sample complexity. Finally, we showcase the practical utility of our framework in a user study on autonomous driving, where we find that the Blackwell winner outperforms the von Neumann winner for the overall preferences.
A Theoretical-Empirical Approach to Estimating Sample Complexity of DNNs
Authors: Devansh Bisla, Apoorva Nandini Saridena, Anna Choromanska
Date: 2021-05-05 00:00:00
Tasks: Autonomous Driving

This paper focuses on understanding how the generalization error scales with the amount of the training data for deep neural networks (DNNs). Existing techniques in statistical learning require computation of capacity measures, such as VC dimension, to provably bound this error. It is however unclear how to extend these measures to DNNs and therefore the existing analyses are applicable to simple neural networks, which are not used in practice, e.g., linear or shallow ones or otherwise multi-layer perceptrons. Moreover, many theoretical error bounds are not empirically verifiable. We derive estimates of the generalization error that hold for deep networks and do not rely on unattainable capacity measures. The enabling technique in our approach hinges on two major assumptions: i) the network achieves zero training error, ii) the probability of making an error on a test point is proportional to the distance between this point and its nearest training point in the feature space and at a certain maximal distance (that we call radius) it saturates. Based on these assumptions we estimate the generalization error of DNNs. The obtained estimate scales as O(1/(\delta N^{1/d})), where N is the size of the training data and is parameterized by two quantities, the effective dimensionality of the data as perceived by the network (d) and the aforementioned radius (\delta), both of which we find empirically. We show that our estimates match with the experimentally obtained behavior of the error on multiple learning tasks using benchmark data-sets and realistic models. Estimating training data requirements is essential for deployment of safety critical applications such as autonomous driving etc. Furthermore, collecting and annotating training data requires a huge amount of financial, computational and human resources. Our empirical estimates will help to efficiently allocate resources.
On the Optimality of Nuclear-norm-based Matrix Completion for Problems with Smooth Non-linear Structure
Authors: Yunhua Xiang, Tianyu Zhang, Xu Wang, Ali Shojaie, Noah Simon
Date: 2021-05-05 00:00:00
Tasks: Matrix Completion

Originally developed for imputing missing entries in low rank, or approximately low rank matrices, matrix completion has proven widely effective in many problems where there is no reason to assume low-dimensional linear structure in the underlying matrix, as would be imposed by rank constraints. In this manuscript, we build some theoretical intuition for this behavior. We consider matrices which are not necessarily low-rank, but lie in a low-dimensional non-linear manifold. We show that nuclear-norm penalization is still effective for recovering these matrices when observations are missing completely at random. In particular, we give upper bounds on the rate of convergence as a function of the number of rows, columns, and observed entries in the matrix, as well as the smoothness and dimension of the non-linear embedding. We additionally give a minimax lower bound: This lower bound agrees with our upper bound (up to a logarithmic factor), which shows that nuclear-norm penalization is (up to log terms) minimax rate optimal for these problems.