Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

0111 · May 201519922001200920172026
16 results for Data-aware

Proposes a new pretraining strategy for RNNs to improve classification performance.

problem Poor generalization of RNNs due to initial parameter assignment.
method Data-aware layer-wise pretraining strategy to initialize RNN parameters.
result Data-aware strategies positively support the initialization of RNN-based classification models.

New study shows data-oblivious attacks can outperform data-aware ones.

problem Comparing effectiveness of data-oblivious and data-aware poisoning attacks.
method Theoretical study of feature selection with LASSO, focusing on separation between full-information and oblivious attackers.
result Data-oblivious attacks can achieve the same results as full-information attacks for feature selection with LASSO.

Many important applications, including signal reconstruction, parameter estimation, and signal processing in a compressed domain, rely on a low-dimensional representation of the dataset that preserves {\em all} pairwise distances between the data points and leverages the inherent geometric structure that is typically p…

2016-09-17abs ↗pdf ↗

Data-aware activation function customization reduces neural network error.

problem Current neural networks lack consideration for specific activation functions.
method Linear algebraic explanation and Diaconis-Shahshahani Approximation Theorem criteria for activation functions.
result Using an even activation function like seagull can reduce neural network error by orders of magnitude.

We develop a new method for regularising neural networks. We learn a probability distribution over the activations of all layers of the model and then insert imputed values into the network during training. We obtain a posterior for an arbitrary subset of activations conditioned on the remainder. This is a generalisati…

2019-09-25abs ↗pdf ↗

A new method reduces the bias in estimating inverse covariance matrices from sketches.

problem Reducing the bias in estimating inverse covariance matrices from sketches.
method Developed a framework for analyzing inversion bias and proposed a new sketching technique called LEverage Score Sparsified (LESS) embeddings.
result The new sketching technique reduces the inversion bias to O(1/d)O(1/\sqrt d) for m=O(d)m=O(d), significantly smaller than the Θ(1)Θ(1) approximation error.

Deep neural networks learn by averaging fast variables, revealing a Gaussian process.

problem Analyzing the complex behavior of deep neural networks (DNNs) with billions of parameters.
method Identifying slow variables that average the erratic behavior of fast microscopic variables in fully trained DNNs.
result DNN layers couple only through the second moment (kernels) of their activations and pre-activations, which fluctuate in a nearly Gaussian manner.

Data-aware methods for dimensionality reduction and matrix decomposition aim to find low-dimensional structure in a collection of data. Classical approaches discover such structure by learning a basis that can efficiently express the collection. Recently, "self expression", the idea of using a small subset of data vect…

2015-05-04abs ↗pdf ↗

Our research proves neural collapse in deep ResNets and transformers is globally optimal.

problem Understanding neural collapse in deep learning models.
method Analysis of deep regularized transformers and ResNets trained with cross entropy or mean squared error loss.
result Global optima of deep regularized transformers and ResNets are approximately collapsed, becoming more prominent as depth increases.

AnomalyCD discovers anomaly causes in large systems with binary flags, reducing computational burden.

problem Learning graphical causal models from large-scale binary anomaly data is computationally expensive.
method AnomalyCD uses anomaly data-aware causality testing, sparse data compression, and edge pruning.
result AnomalyCD reduces computation overhead and improves accuracy on binary anomaly datasets.

This paper explores how kernel methods can explain data effects on neural collapse.

problem Understanding how data affects neural collapse in neural networks.
method Formulating NC1 as a function of kernel, specializing to NNGP and NTK, and exploring a data-aware Gaussian Process kernel.
result The NTK does not represent more collapsed features than the NNGP for Gaussian data, highlighting the limitations of data-independent kernels.