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

Trend · papers per month

77154230307 · Jun 202019922001200920172026
48 results for procedure transformation

Probabilistic inference procedures are usually coded painstakingly from scratch, for each target model and each inference algorithm. We reduce this effort by generating inference procedures from models automatically. We make this code generation modular by decomposing inference algorithms into reusable program-to-progr…

2016-03-06abs ↗pdf ↗

Transformer learns representations from time series data for money laundering detection.

problem Detecting money laundering using structured time series data.
method Contrastive learning for representation learning, followed by scoring and thresholding.
result Transformer outperforms rule-based and LSTM methods in detecting money laundering with controlled false positives.

Transformers can learn optimal regression mixtures efficiently.

problem Limited adoption of tailored regression methods due to their model-specific nature.
method Constructed a generative process for a mixture of linear regressions and used transformers to learn optimal predictors.
result Transformers achieve low mean-squared error and make predictions close to the optimal procedure.

A procedure for unfolding the true distribution from experimental data is presented. Machine learning methods are applied for simultaneous identification of an apparatus function and solving of an inverse problem. A priori information about the true distribution from theory or previous experiments is used for Monte-Car…

2010-04-12abs ↗pdf ↗

For the equations of the form y=P(x,y)+3Q(x,y)y+3R(x,y)y2+S(x,y)y3y''=P(x,y)+3 Q(x,y) y'+3 R(x,y) {y'}^2 +S(x,y) {y'}^3 the problem of equivalence in the class of point transformations is considered. Effective procedure for determining the class of point equivalence for the given equation is suggested. This procedure is based on explicit formulas for t…

1998-02-05abs ↗pdf ↗

Novel privatization framework for high-dimensional variable selection with differential privacy.

problem High-dimensional controlled variable selection with rigorous FDR control under differential privacy constraints.
method Gaussian Johnson-Lindenstrauss Transformation for privatizing the knockoff matrix.
result The proposed private variable selection procedure maintains statistical power even under strict privacy budgets.

We show that unconverged stochastic gradient descent can be interpreted as a procedure that samples from a nonparametric variational approximate posterior distribution. This distribution is implicitly defined as the transformation of an initial distribution by a sequence of optimization updates. By tracking the change …

2015-04-06abs ↗pdf ↗

Meta-ANOVA simplifies complex models for better interpretability.

problem Complex models are hard to interpret, limiting their use in fields needing accountability.
method Transforms black-box models into interpretable ANOVA models by screening unnecessary interactions.
result Meta-ANOVA provides an interpretable model for any prediction model, proving asymptotic consistency.

We consider a modification of the covariance function in Gaussian processes to correctly account for known linear constraints. By modelling the target function as a transformation of an underlying function, the constraints are explicitly incorporated in the model such that they are guaranteed to be fulfilled by any sam…

2017-03-02abs ↗pdf ↗

Shapelet transform improves time series classification for earthquake, wind, and wave events.

problem Autonomous detection of specific events from large time series datasets in civil engineering.
method Shapelet transform for local similarity in time series subsequences, combined with machine learning.
result Shapelet transform yields a new feature representation for time series signals in civil engineering.

Whitening, or sphering, is a common preprocessing step in statistical analysis to transform random variables to orthogonality. However, due to rotational freedom there are infinitely many possible whitening procedures. Consequently, there is a diverse range of sphering methods in use, for example based on principal com…

2015-12-02abs ↗pdf ↗

The version of Marsden-Ratiu reduction theorem for Nambu-Poisson manifolds by a regular distribution has been studied by Ibaˊn~\acute{\text{a}}\tilde{\text{n}}ez et al. In this paper we show that the reduction is always ensured unless the distribution is zero. Next we extend the more general Falceto-Zambon Poisson reduct…

2017-02-06abs ↗pdf ↗

Transformers can learn spectral methods and perform unsupervised learning.

problem Learning spectral methods using unsupervised learning.
method Using multi-layered Transformers, pre-trained on a large set of instances, to learn and perform statistical estimation tasks.
result Proven that pre-trained Transformers can learn spectral methods and perform tasks like PCA and clustering.

Generalising well in supervised learning tasks relies on correctly extrapolating the training data to a large region of the input space. One way to achieve this is to constrain the predictions to be invariant to transformations on the input that are known to be irrelevant (e.g. translation). Commonly, this is done thro…

2018-08-16abs ↗pdf ↗

In the previous paper, the author defined equivariant Floer cohomology for a complete intersection in a toric variety and showed that it is isomorphic to the small quantum D-module after a mirror transformation when the first Chern class c_1(M) of the tangent bundle is nef. In this paper, even when c_1(M) is not nef, w…

2004-11-05abs ↗pdf ↗

Transformers capture combinatorial tasks with bounded error and logarithmic sample dependence.

problem Capturing complex combinatorial tasks with bounded error and sample efficiency.
method Formal definition of algorithmic capture, empirical analysis of infinite-width transformers, upper bounds on computational complexity.
result Transformers exhibit an inductive bias favoring simpler algorithmic procedures over higher complexity ones.

A new method improves likelihood-free Bayesian inference by transforming summary statistics and using efficient Variational Bayes.

problem Incorrectly assuming normally distributed summary statistics in likelihood-free Bayesian inference.
method Wasserstein Gaussianization transformation combined with robust BSL and efficient Variational Bayes.
result Highly efficient and reliable approximate Bayesian inference for likelihood-free problems.

Transformers can implement reinforcement learning algorithms from data without updates.

problem Training reinforcement learning algorithms from data without parameter updates.
method Design a teacher-mimicking training procedure for transformers to implement policy-improvement methods.
result Gradient flow converges to an optimal parameter manifold corresponding to the desired RL update.

This paper explores how Transformers predict next tokens in autoregressive tasks.

problem Understanding the success of Transformers in autoregressive learning.
method Trained a Transformer on a next-token prediction task, focusing on commuting orthogonal matrices.
result Trained Transformers can be seen as implementing gradient descent for a specific objective function.

This study proposes a trainable adaptive window switching (AWS) method and apply it to a deep-neural-network (DNN) for speech enhancement in the modified discrete cosine transform domain. Time-frequency (T-F) mask processing in the short-time Fourier transform (STFT)-domain is a typical speech enhancement method. To re…

2018-11-05abs ↗pdf ↗

Regression models for supervised learning problems with a continuous target are commonly understood as models for the conditional mean of the target given predictors. This notion is simple and therefore appealing for interpretation and visualisation. Information about the whole underlying conditional distribution is, h…

2017-01-09abs ↗pdf ↗

Paper describes anomaly detection and explainability for multivariate functional data.

problem Anomaly detection and explainability in multivariate functional data.
method Transform series into features, use Isolation Forest, compute SHAP coefficients, and use supervised decision tree.
result Method performs well on simulated and real industry data.

The paper uses transformed ANOVA to identify important fire detection variables.

problem Identifying key variables for forest fire detection.
method Developed a complete orthonormal system for standard normal distribution, applied Z-score transformation, and used ANOVA approximation.
result Attribute ranking reveals important variables for fire detection.

Develops a Causal Transformer for estimating counterfactual outcomes from longitudinal data.

problem Estimating counterfactual outcomes over time from observational data is challenging due to complex, long-range dependencies.
method Combines three transformer subnetworks with separate inputs for time-varying covariates, previous treatments, and previous outcomes into a joint network with in-between cross-attentions. Uses a custom, end-to-end training procedure with a counterfactual domain confusion loss to address confounding bias.
result Achieves superior performance over current baselines in synthetic and real-world datasets.

Efficiently transforms samples from various statistical models.

problem Approximately transforming samples from one statistical model to another without knowing the source model's parameters.
method Constructs computationally efficient procedures to reduce uniform, Erlang, and Laplace models to general target families.
result Establishes nonasymptotic reductions between canonical high-dimensional problems, such as mixtures of experts, phase retrieval, and signal denoising.

The paper develops a computational method for efficient online filtering of diffusion processes.

problem Online filtering of discretely observed nonlinear diffusion processes.
method The approach involves Doob's hh-transforms approximated by solving backward Kolmogorov equations using nonlinear Feynman-Kac formulas and neural networks.
result The proposed method can be orders of magnitude more efficient than state-of-the-art particle filters.

We define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the "raw coordinates" encountered in spectral clustering, and can be extended by means of higher-dimensional embeddings (Schoenberg transformations). Geographical flow …

2010-07-06abs ↗pdf ↗

Looped transformers with LN converge to power method for principal component prediction.

problem Understanding how transformers learn algorithmic procedures.
method Study of principal component prediction with looped linear transformers and layer normalization.
result Gradient descent trains looped transformers with LN to implement the power method for principal component prediction.

We show that for n>2 the following equivalence problems are essentially the same: the equivalence problem for Lagrangians of order n with one dependent and one independent variable considered up to a contact transformation, a multiplication by a nonzero constant, and modulo divergence; the equivalence problem for the s…

2010-04-10abs ↗pdf ↗

We present an improved Bayesian framework for performing inference of affine transformations of constrained functions. We focus on quadrature with nonnegative functions, a common task in Bayesian inference. We consider constraints on the range of the function of interest, such as nonnegativity or boundedness. Although …

2018-02-13abs ↗pdf ↗