arXiv research

Myia compiler optimizes ML models with efficient AD for array programming.

NLM combines neural networks and logic programming for complex reasoning.

We present a system for the automatic differentiation of a higher-order functional array-processing language. The core functional language underlying this system simultaneously supports both source-to-source automatic differentiation and global optimizations such as loop transformations. Thanks to this feature, we demo…

The need to efficiently calculate first- and higher-order derivatives of increasingly complex models expressed in Python has stressed or exceeded the capabilities of available tools. In this work, we explore techniques from the field of automatic differentiation (AD) that can give researchers expressive power, performa…

Paper proves tensor ring completion with high probability using convex optimization.

We design a new myopic strategy for a wide class of sequential design of experiment (DOE) problems, where the goal is to collect data in order to to fulfil a certain problem specific goal. Our approach, Myopic Posterior Sampling (MPS), is inspired by the classical posterior (Thompson) sampling algorithm for multi-armed…

This research develops an evolutionary approach to discover non-Gaussian stochastic dynamical systems.

Probabilistic models often have parameters that can be translated, scaled, permuted, or otherwise transformed without changing the model. These symmetries can lead to strong correlation and multimodality in the posterior distribution over the model's parameters, which can pose challenges both for performing inference a…

New method for invariant neural networks using probabilistic symmetries.

Improves magnetic field mapping using an array of magnetometers with noisy input.

Simpler proof for non-basic sets in 2D.

Paper improves DOA estimation in sparse arrays using Siamese neural networks.

Direction of arrival (DoA) estimation of targets improves with the number of elements employed by a phased array radar antenna. Since larger arrays have high associated cost, area and computational load, there is recent interest in thinning the antenna arrays without loss of far-field DoA accuracy. In this context, a c…

Analog arrays are a promising upcoming hardware technology with the potential to drastically speed up deep learning. Their main advantage is that they compute matrix-vector products in constant time, irrespective of the size of the matrix. However, early convolution layers in ConvNets map very unfavorably onto analog a…

Novel CNN array for sign language recognition using wearable IMUs.

The CHAMPION study clusters multi-dimensional accelerometer data to understand health links.

In this demo paper, we introduce the DARPA D3M program for automatic machine learning (ML) and JPL's MARVIN tool that provides an environment to locate, annotate, and execute machine learning primitives for use in ML pipelines. MARVIN is a web-based application and associated back-end interface written in Python that e…

New algorithm eliminates symmetry requirement for training neural networks on resistive device arrays.

This paper improves neural network efficiency by combining filter columns and retraining, boosting array utilization and accuracy.

Missing data is an important challenge when dealing with high dimensional data arranged in the form of an array. In this paper, we propose methods for estimation of the parameters of array variate normal probability model from partially observed multiway data. The methods developed here are useful for missing data impu…

Memristors have recently received significant attention as ubiquitous device-level components for building a novel generation of computing systems. These devices have many promising features, such as non-volatility, low power consumption, high density, and excellent scalability. The ability to control and modify biasin…

A neural network, IHT-Net, improves DOA estimation with sparse arrays.

ASKAP observes a region of the Galactic plane, identifying 3963 radio sources.

CAESAR source finder improves automated source extraction for ASKAP surveys.

Robust STAP with coprime arrays reduces clutter using sparse modeling.

Paper proposes a learning-based sparse Bayesian method for accurate off-grid DOA estimation.

Infinite Tucker Decomposition (InfTucker) and random function prior models, as nonparametric Bayesian models on infinite exchangeable arrays, are more powerful models than widely-used multilinear factorization methods including Tucker and PARAFAC decomposition, (partly) due to their capability of modeling nonlinear rel…

We augment the nonnegative matrix factorization method for audio source separation with cues about directionality of sound propagation. This improves separation quality greatly and removes the need for training data, with only a twofold increase in run time. This is the first method which can exploit directional inform…

Anomaly detection is one of the frequent and important subroutines deployed in large-scale data processing systems. Even being a well-studied topic, existing techniques for unsupervised anomaly detection require storing significant amounts of data, which is prohibitive from memory and latency perspective. In the big-da…

Deep neural networks improve angle of arrival estimation with lower complexity.

This paper proposes a learning framework for n-bit quantized neural networks that improves accuracy and speed on FPGAs.

We consider two eigenvalue problems for Laplacian on some specific doubly connected domain. In particular, we study the following two eigenvalue problems. Let $B_1$ be an open ball in $\mathbb{R}^n$ and $B_0$ be a ball contained in $B_1$. Let $ν$ be the outward unit normal on $\partial B_1$. Then the first eigenvalue o…

This paper conducts a rigorous analysis for provable estimation of multidimensional arrays, in particular third-order tensors, from a random subset of its corrupted entries. Our study rests heavily on a recently proposed tensor algebraic framework in which we can obtain tensor singular value decomposition (t-SVD) that …

In this paper we prove the following geometric inequality in the hyperbolic space $\H^n$ ($n\ge 5)$, which is a hyperbolic Alexandrov-Fenchel inequality, \[\begin{array}{rcl} \ds \int_Σ\s_4 d μ\ge \ds\vs C_{n-1}^4ω_{n-1}\left\{\left(\frac{|Σ|}{ω_{n-1}} \right)^\frac 12 + \left(\frac{|Σ|}{ω_{n-1}} \right)^{\frac 12\frac…

The paper proves existence of solutions for mean field equations on compact Riemann surfaces.

Differentiable sorting framework using optimal transport.

Techniques for data-mining, latent semantic analysis, contextual search of databases, etc. have long ago been developed by computer scientists working on information retrieval (IR). Experimental scientists, from all disciplines, having to analyse large collections of raw experimental data (astronomical, physical, biolo…

In order to cope with the increased data volumes generated by modern radio interferometers such as LOFAR (Low Frequency Array) or SKA (Square Kilometre Array), fast and efficient calibration algorithms are essential. Traditional radio interferometric calibration is performed using nonlinear optimization techniques such…

Efficient FPGA dropout algorithm reduces memory usage.

This paper introduces an efficient method for optimizing deep learning hyperparameters.

We introduce a tensor-based clustering method to extract sparse, low-dimensional structure from high-dimensional, multi-indexed datasets. This framework is designed to enable detection of clusters of data in the presence of structural requirements which we encode as algebraic constraints in a linear program. Our cluste…

This paper proves a conjecture about unique positive harmonic functions in a ball.

Stochastic partition models tailor a product space into a number of rectangular regions such that the data within each region exhibit certain types of homogeneity. Due to constraints of partition strategy, existing models may cause unnecessary dissections in sparse regions when fitting data in dense regions. To allevia…

We apply the OSCAR (octagonal selection and clustering algorithms for regression) in recovering group-sparse matrices (two-dimensional---2D---arrays) from compressive measurements. We propose a 2D version of OSCAR (2OSCAR) consisting of the $\ell_1$ norm and the pair-wise $\ell_{\infty}$ norm, which is convex but non-d…

Paper solves curvature prescription problem on surfaces with boundary.

Activities in reinforcement learning (RL) revolve around learning the Markov decision process (MDP) model, in particular, the following parameters: state values, V; state-action values, Q; and policy, pi. These parameters are commonly implemented as an array. Scaling up the problem means scaling up the size of the arra…

Improved classifier accuracy by using more of the class-specific structure in trained models.

This paper designs sensor arrays for estimating unsteady flows efficiently.