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.
GNMR controls runtime stability in low-precision language model training.
Training neural network often uses a machine learning framework such as TensorFlow and Caffe2. These frameworks employ a dataflow model where the NN training is modeled as a directed graph composed of a set of nodes. Operations in neural network training are typically implemented by the frameworks as primitives and rep…
Framework insures AI actions with reserve capital, preventing loss.
Model predicts counterfactuals under domain shift and inaccessible variables.
New method controls linear systems with partial info and disturbances.
As deep neural network (NN) methods have matured, there has been increasing interest in deploying NN solutions to "edge computing" platforms such as mobile phones or embedded controllers. These platforms are often resource-constrained, especially in energy storage and power, but state-of-the-art NN architectures are de…
Insurance contracts for autonomous AI agents must be actuarially sound and resistant to gaming.
CIT and CIF improve feature selection for downstream prediction.
PEMC uses ML to enhance Monte Carlo simulations, reducing variance and runtime.
Extends RL to random stopping times, improving optimization.
Vecchia approximations provide the best accuracy-runtime trade-off for Gaussian process approximations.
Improves state space models' resistance to noise.
Stochastic momentum methods trade compute efficiency for serial runtime.
Bayesian method predicts runtime metrics for fog manufacturing.
The runtime for Kernel Partial Least Squares (KPLS) to compute the fit is quadratic in the number of examples. However, the necessity of obtaining sensitivity measures as degrees of freedom for model selection or confidence intervals for more detailed analysis requires cubic runtime, and thus constitutes a computationa…
Asynchronous SGD can speed up training with a trade-off of gradient staleness.
Algorithm decides if two hyperbolic 3-manifolds are homeomorphic.
The generation of artificial data based on existing observations, known as data augmentation, is a technique used in machine learning to improve model accuracy, generalisation, and to control overfitting. Augmentor is a software package, available in both Python and Julia versions, that provides a high level API for th…
For well over a quarter century, detection systems have been driven by models learned from input features collected from real or simulated environments. An artifact (e.g., network event, potential malware sample, suspicious email) is deemed malicious or non-malicious based on its similarity to the learned model at runt…
In many recent applications, data is plentiful. By now, we have a rather clear understanding of how more data can be used to improve the accuracy of learning algorithms. Recently, there has been a growing interest in understanding how more data can be leveraged to reduce the required training runtime. In this paper, we…
New method reduces memory usage for high-dimensional variable selection.
Separating the short jobs from the long is a known technique to improve scheduling performance. In this paper we describe a method we developed for accurately predicting the runtimes classes of the jobs to enable this separation. Our method uses the fact that the runtimes can be represented as a mixture of overlapping …
Perhaps surprisingly, it is possible to predict how long an algorithm will take to run on a previously unseen input, using machine learning techniques to build a model of the algorithm's runtime as a function of problem-specific instance features. Such models have important applications to algorithm analysis, portfolio…
msPCA solves sparse PCA for multiple components efficiently.
Paper develops efficient recursive learning for multi-channel systems with heterogeneous dynamics.
Run2Survive uses survival analysis for algorithm selection, outperforming traditional methods.
The event-driven and elastic nature of serverless runtimes makes them a very efficient and cost-effective alternative for scaling up computations. So far, they have mostly been used for stateless, data parallel and ephemeral computations. In this work, we propose using serverless runtimes to solve generic, large-scale …
Fully Homomorphic Encryption (FHE) refers to a set of encryption schemes that allow computations to be applied directly on encrypted data without requiring a secret key. This enables novel application scenarios where a client can safely offload storage and computation to a third-party cloud provider without having to t…
This work develops a fast-running ROM for MOOSE-based AM model using OL.
A new runtime for AI agents calculates risks in real-time.
New method for valid prediction intervals in counterfactual outcomes with runtime confounding.
Distributed Stochastic Gradient Descent (SGD) when run in a synchronous manner, suffers from delays in waiting for the slowest learners (stragglers). Asynchronous methods can alleviate stragglers, but cause gradient staleness that can adversely affect convergence. In this work we present a novel theoretical characteriz…
This paper presents Rudra, a parameter server based distributed computing framework tuned for training large-scale deep neural networks. Using variants of the asynchronous stochastic gradient descent algorithm we study the impact of synchronization protocol, stale gradient updates, minibatch size, learning rates, and n…
Research on nearest-neighbor methods tends to focus somewhat dichotomously either on the statistical or the computational aspects -- either on, say, Bayes consistency and rates of convergence or on techniques for speeding up the proximity search. This paper aims at bridging these realms: to reap the advantages of fast …
New algorithm reduces runtime for robust sparse mean estimation.
We present any-precision deep neural networks (DNNs), which are trained with a new method that allows the learned DNNs to be flexible in numerical precision during inference. The same model in runtime can be flexibly and directly set to different bit-widths, by truncating the least significant bits, to support dynamic …
d3p package enables efficient Bayesian inference with differential privacy.
Rewiring networks using discrete geometry improves GNN training accuracy and reduces runtime.
Compress++ speeds up distribution compression to near-linear time.
The automatic classification of applications and services is an invaluable feature for new generation mobile networks. Here, we propose and validate algorithms to perform this task, at runtime, from the raw physical channel of an operative mobile network, without having to decode and/or decrypt the transmitted flows. T…
New DP algorithm improves privacy and efficiency for convex optimization.
Graph convolutional networks (GCNs) are powerful deep neural networks for graph-structured data. However, GCN computes the representation of a node recursively from its neighbors, making the receptive field size grow exponentially with the number of layers. Previous attempts on reducing the receptive field size by subs…
Predicting the runtime complexity of a programming code is an arduous task. In fact, even for humans, it requires a subtle analysis and comprehensive knowledge of algorithms to predict time complexity with high fidelity, given any code. As per Turing's Halting problem proof, estimating code complexity is mathematically…
Improved computational efficiency for estimating Wasserstein distance.
A new method estimates generative model mappings using kernel transfer operators, reducing costs and improving performance.
New method predicts outcomes even when some factors are not used in models.
RCNPs extend equivariant neural processes to higher dimensions, improving performance on tasks with inherent symmetries.
Permutation testing is a non-parametric method for obtaining the max null distribution used to compute corrected -values that provide strong control of false positives. In neuroimaging, however, the computational burden of running such an algorithm can be significant. We find that by viewing the permutation testing …