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.
A new robust scaling approach improves downstream metabolomics analysis.
We extend our previous study of scaling range properties done for detrended fluctuation analysis (DFA) \cite{former_paper} to other techniques of fluctuation analysis (FA). The new technique called Modified Detrended Moving Average Analysis (MDMA) is introduced and its scaling range properties are examined and compared…
The abstract explores connections between reinforcement learning, scaling, and diffusion.
This study evaluates feature scaling across 14 datasets and 12 techniques in ML.
Online Platt Scaling adapts to varying data distributions.
New method makes quality metrics scale-invariant for high-dimensional data.
A new L-BFGS method tackles large-scale optimization with fewer evaluations.
A technique scales symbolic methods with gradients for neural model explanation.
Study scaling limits of utility indifference prices in discretized Bachelier model.
Paper presents an efficient algorithm for learning minimax risk classifiers with large-scale data.
We consider the Nordic electricity spot market from mid 1992 to the end of year 2000. This market is found to be well approximated by an anti-persistent self-affine (mean-reverting) walk. It is characterized by a Hurst exponent of over three orders of magnitude in time ranging from days to years. We argu…
The authors study the method of scaling in the context of the study of automorphism groups of complex domains in multiple dimensions. Various types of scaling techniques are compared and contrasted. Applications are given in a number of areas of complex geometric analysis. Relations with other parts of mathematics are …
Mixed precision training (MPT) is becoming a practical technique to improve the speed and energy efficiency of training deep neural networks by leveraging the fast hardware support for IEEE half-precision floating point that is available in existing GPUs. MPT is typically used in combination with a technique called los…
Nearest Neighbors Algorithm is a Lazy Learning Algorithm, in which the algorithm tries to approximate the predictions with the help of similar existing vectors in the training dataset. The predictions made by the K-Nearest Neighbors algorithm is based on averaging the target values of the spatial neighbors. The selecti…
We present ShapeVis, a scalable visualization technique for point cloud data inspired from topological data analysis. Our method captures the underlying geometric and topological structure of the data in a compressed graphical representation. Much success has been reported by the data visualization technique Mapper, th…
New learning dynamics achieve fast convergence in games without needing to know utility scales.
Automated synthesis of inductive invariants is an important problem in software verification. Once all the invariants have been specified, software verification reduces to checking of verification conditions. Although static analyses to infer invariants have been studied for over forty years, recent years have seen a f…
The study examines how verifier imperfections impact test-time scaling techniques.
This paper analyzes convergence of large-scale Transformers with weight decay.
Attack graphs provide compact representations of the attack paths that an attacker can follow to compromise network resources by analysing network vulnerabilities and topology. These representations are a powerful tool for security risk assessment. Bayesian inference on attack graphs enables the estimation of the risk …
Generative model improves noise estimation in stochastic rotating shallow water models.
We study linear models under heavy-tailed priors from a probabilistic viewpoint. Instead of computing a single sparse most probable (MAP) solution as in standard deterministic approaches, the focus in the Bayesian compressed sensing framework shifts towards capturing the full posterior distribution on the latent variab…
The application of machine learning techniques to large-scale personalized recommendation problems is a challenging task. Such systems must make sense of enormous amounts of implicit feedback in order to understand user preferences across numerous product categories. This paper presents a deep learning based solution t…
Classical multidimensional scaling is an important dimension reduction technique. Yet few theoretical results characterizing its statistical performance exist. This paper provides a theoretical framework for analyzing the quality of embedded samples produced by classical multidimensional scaling. This lays the foundati…
Matrix Factorization (MF) on large scale matrices is computationally as well as memory intensive task. Alternative convergence techniques are needed when the size of the input matrix is higher than the available memory on a Central Processing Unit (CPU) and Graphical Processing Unit (GPU). While alternating least squar…
While Generative Adversarial Networks (GANs) have seen huge successes in image synthesis tasks, they are notoriously difficult to adapt to different datasets, in part due to instability during training and sensitivity to hyperparameters. One commonly accepted reason for this instability is that gradients passing from t…
Artificial neural networks (ANNs) have achieved significant success in tackling classical and modern machine learning problems. As learning problems grow in scale and complexity, and expand into multi-disciplinary territory, a more modular approach for scaling ANNs will be needed. Modular neural networks (MNNs) are neu…
Spectral analysis of neighborhood graphs is one of the most widely used techniques for exploratory data analysis, with applications ranging from machine learning to social sciences. In such applications, it is typical to first encode relationships between the data samples using an appropriate similarity function. Popul…
New algorithm bounds MAB regret for unknown scale and magnitude of losses.
The weighted nearest neighbors (WNN) estimator has been popularly used as a flexible and easy-to-implement nonparametric tool for mean regression estimation. The bagging technique is an elegant way to form WNN estimators with weights automatically generated to the nearest neighbors; we name the resulting estimator as t…
This dissertation advances scalable Gaussian processes using iterative methods and pathwise conditioning.
Lapse improves parameter servers by dynamically allocating parameters, achieving near-linear scaling.
This paper provides a review and commentary on the past, present, and future of numerical optimization algorithms in the context of machine learning applications. Through case studies on text classification and the training of deep neural networks, we discuss how optimization problems arise in machine learning and what…
We rigorously evaluate three state-of-the-art techniques for inducing sparsity in deep neural networks on two large-scale learning tasks: Transformer trained on WMT 2014 English-to-German, and ResNet-50 trained on ImageNet. Across thousands of experiments, we demonstrate that complex techniques (Molchanov et al., 2017;…
Study on learning properties of scale-dependent kernels controlling stability and error.
Probabilistic programming languages can simplify the development of machine learning techniques, but only if inference is sufficiently scalable. Unfortunately, Bayesian parameter estimation for highly coupled models such as regressions and state-space models still scales poorly; each MCMC transition takes linear time i…
Our work investigates disagreement in neural network feature attribution methods.
A new method improves SVI for high-dimensional, poorly-conditioned distributions.
Paper solves robust multi-dimensional scaling with accelerated projections.
Study utility indifference pricing with delayed investment information in a Bachelier model.
Study scaling limits for option pricing in trinomial models.
Paper proposes scalable privacy-preserving DNN for industrial applications.
Frank-Wolfe algorithms have recently regained the attention of the Machine Learning community. Their solid theoretical properties and sparsity guarantees make them a suitable choice for a wide range of problems in this field. In addition, several variants of the basic procedure exist that improve its theoretical proper…
Large batch training improves deep learning performance without needing warmup.
In this article we review several techniques to extract information from stock market data. We discuss recurrence analysis of time series, decomposition of aggregate correlation matrices to study co-movements in financial data, stock level partial correlations with market indices, multidimensional scaling and minimum s…
Efficiently solves large-scale robust portfolio optimization problems.
A method for large scale Gaussian process classification has been recently proposed based on expectation propagation (EP). Such a method allows Gaussian process classifiers to be trained on very large datasets that were out of the reach of previous deployments of EP and has been shown to be competitive with related tec…
Different investment strategies are adopted in short-term and long-term depending on the time scales, even though time scales are adhoc in nature. Empirical mode decomposition based Hurst exponent analysis and variance technique have been applied to identify the time scales for short-term and long-term investment from …