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,982 papers · 148 categories

Trend · papers per month

1223 · May 201919922001200920172026
27 results for Magnetoresistive RAM

High error rates improve neural network performance and reduce power consumption.

problem Training neural networks with high Bit Error Rates (BERs).
method Trained three Binarized Convolutional Neural Network architectures on various datasets with high BERs.
result High BERs do not significantly degrade test accuracy, enabling more efficient hardware.

RAMs improve GAMs' accuracy by fitting components to subregions of feature space.

problem Subpar accuracy in GAMs due to inability to capture feature interactions.
method Identify subregions of feature space where interactions are minimized, fitting one component per subregion.
result RAMs offer improved expressiveness compared to GAMs while maintaining interpretability.

Federated Learning tackles limited user participation with a new risk-aware approach.

problem Limited availability of users in federated learning environments.
method Random Access Model (RAM) and Conditional Value-at-Risk (CVaR) to design a risk-aware federated learning algorithm.
result The proposed approach achieves significantly improved performance under various setups compared to standard federated learning.

Memory-augmented neural networks consisting of a neural controller and an external memory have shown potentials in long-term sequential learning. Current RAM-like memory models maintain memory accessing every timesteps, thus they do not effectively leverage the short-term memory held in the controller. We hypothesize t…

2019-01-05abs ↗pdf ↗

Improves bit error tolerance in RRAM-based BNNs without overfitting.

problem Bit errors in RRAM-based BNNs reduce accuracy and overfit to training error rates.
method Proposes straight-through gradient approximation and a novel regularizer.
result Improves BNNs' robustness to bit errors without overfitting.

This paper optimizes SMPC for neural network inference, reducing memory and time.

problem Memory and time constraints in secure neural network inference.
method Implemented ABY2.0 protocol, optimized memory usage, and used a helper node.
result MNIST inference reduced from 8.03 GB RAM and 200s to 0.2 GB RAM and 32s.

The paper studies causal effects of multiple treatments in healthcare databases with rare outcomes.

problem Estimating causal effects of multiple treatments in healthcare databases with rare outcomes.
method The paper designs three sets of simulations and compares the operating characteristics of three types of methods: Bayesian Additive Regression Trees (BART), regression adjustment on multivariate spline of generalized propensity scores (RAMS), and inverse probability of treatment weighting (IPTW) with multinomial logistic regression or generalized boosted models.
result BART and RAMS provide lower bias and mean squared error compared to IPTW methods.

Regression problems that have closed-form solutions are well understood and can be easily implemented when the dataset is small enough to be all loaded into the RAM. Challenges arise when data is too big to be stored in RAM to compute the closed form solutions. Many techniques were proposed to overcome or alleviate the…

2019-03-03abs ↗pdf ↗

This paper compares FAISS and FENSHSES for nearest neighbor search in Hamming space.

problem Comparing nearest neighbor search systems in Hamming space.
method Comprehensive evaluations of indexing speed, search latency, and RAM consumption.
result Better understanding of trade-offs between main memory and secondary memory systems.

We introduce an exact distributed algorithm to train Random Forest models as well as other decision forest models without relying on approximating best split search. We explain the proposed algorithm and compare it to related approaches for various complexity measures (time, ram, disk, and network complexity analysis).…

2018-04-18abs ↗pdf ↗

This paper investigates compression techniques for deep neural networks to reduce their size without sacrificing performance.

problem Compression of large deep neural networks for resource-limited platforms.
method Weight pruning, quantization, and lossless weight matrix representations based on source coding.
result Achieved up to 165 times compression rate while maintaining or improving model performance.

In this paper, a taxonomy for memory networks is proposed based on their memory organization. The taxonomy includes all the popular memory networks: vanilla recurrent neural network (RNN), long short term memory (LSTM ), neural stack and neural Turing machine and their variants. The taxonomy puts all these networks und…

2018-05-01abs ↗pdf ↗

This paper investigates whether learning contingency-awareness and controllable aspects of an environment can lead to better exploration in reinforcement learning. To investigate this question, we consider an instantiation of this hypothesis evaluated on the Arcade Learning Element (ALE). In this study, we develop an a…

2018-11-05abs ↗pdf ↗

Multidimensional time series are sequences of real valued vectors. They occur in different areas, for example handwritten characters, GPS tracking, and gestures of modern virtual reality motion controllers. Within these areas, a common task is to search for similar time series. Dynamic Time Warping (DTW) is a common di…

2018-04-17abs ↗pdf ↗

Bayesian realized EGARCH models improve tail risk forecasting.

problem Forecasting tail risks in financial markets.
method Developed a Bayesian framework for realized EGARCH models, incorporating multiple realized volatility measures and using robust adaptive Metropolis algorithm for estimation.
result Standardized skewed Student-t distribution and sub-sampled realized range models outperform other models in tail risk forecasting.

Develops a Riemannian archetypal analysis for interpretable non-linear data.

problem Limited performance of classical archetypal analysis on non-linear data.
method Riemannian geometry for data-driven pullback, geodesic convex combinations, convex relaxation followed by non-convex refinement.
result Combines interpretability of classical archetypal analysis with expressive power of modern non-linear models.

Bayesian Neural Networks (BNNs) have been proposed to address the problem of model uncertainty in training and inference. By introducing weights associated with conditioned probability distributions, BNNs are capable of resolving the overfitting issue commonly seen in conventional neural networks and allow for small-da…

2018-02-02abs ↗pdf ↗

Big T-Rex solves FDR-controlled sparse regression on laptops with millions of variables.

problem Scalable FDR-controlled variable selection for high-dimensional data.
method Early terminated random experiments with memory-mapping and permutation-based dummy generation.
result Solves FDR-controlled Lasso problems with 5 million variables on a laptop in 30 minutes.

In real world industrial applications of topic modeling, the ability to capture gigantic conceptual space by learning an ultra-high dimensional topical representation, i.e., the so-called "big model", is becoming the next desideratum after enthusiasms on "big data", especially for fine-grained downstream tasks such as …

2014-11-10abs ↗pdf ↗

This paper enables deep network inference on microcontrollers with improved accuracy and reduced memory usage.

problem Deploying deep networks on resource-constrained edge-devices with low memory and computational constraints.
method Mixed low-bitwidth compression, rule-based iterative procedure for bit precision determination, quantization-aware retraining, and integer-only model conversion.
result Improved Top1 accuracy of 68% on a 2MB FLASH memory STM32H7 microcontroller, 8% higher than 8-bit implementations.

Improved deep learning model deployment on tiny MCUs with mixed-precision quantization.

problem Memory limitations prevent accurate deployment of DNN models on tiny MCUs.
method Automated mixed-precision quantization using Reinforcement Learning for MCU constraints.
result Mixed-precision models achieve high accuracy with uniform quantization policies.

The kk-Nearest Neighbor Search (kk-NNS) is the backbone of several cloud-based services such as recommender systems, face recognition, and database search on text and images. In these services, the client sends the query to the cloud server and receives the response in which case the query and response are revealed t…

2019-04-03abs ↗pdf ↗