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

Trend · papers per month

68135203270 · Jun 202019922001200920172026
48 results for log transformation

Paper derives a simplified formula for Expected Improvement using log-transformed data.

problem Challenges in enhancing Bayesian optimization with Expected Improvement.
method Derives a closed form of Expected Improvement for Gaussian process trained on log-transformed objective.
result Provides a simplified formula for Expected Improvement.

Several classification methods assume that the underlying distributions follow tree-structured graphical models. Indeed, trees capture statistical dependencies between pairs of variables, which may be crucial to attain low classification errors. The resulting classifier is linear in the log-transformed univariate and b…

2018-06-06abs ↗pdf ↗

Firm size data usually do not show the normality that is often assumed in statistical analysis such as regression analysis. In this study we focus on two firm size data: the number of employees and sale. Those data deviate considerably from a normal distribution. To improve the normality of those data we transform them…

2015-11-23abs ↗pdf ↗

Transformers can efficiently approximate nonparametric regression with minimal parameters and sequences.

problem Efficiently approximating nonparametric regression functions with transformers.
method Kernel-weighted polynomial basis and gradient descent.
result Achieves minimax optimal rate of convergence with fewer parameters and sequences.

The paper improves transformer generalization bounds using rank-dependent covering number bounds.

problem Improving generalization bounds for transformers.
method Introducing rank-dependent covering number bounds for linear function classes and applying them to transformers.
result Generalization error bounds for transformers decay as O(1/n)O(1/\sqrt{n}) and O(logrw)O(\log r_w), improving existing bounds.

We study topological properties of log-symplectic structures and produce examples of compact manifolds with such structures. Notably we show that several symplectic manifolds do not admit log-symplectic structures and several log-symplectic manifolds do not admit symplectic structures, for example #m CP^2 # n bar(CP^2)…

2013-03-26abs ↗pdf ↗

Unsupervised learning of probabilistic models is a central yet challenging problem in machine learning. Specifically, designing models with tractable learning, sampling, inference and evaluation is crucial in solving this task. We extend the space of such models using real-valued non-volume preserving (real NVP) transf…

2016-05-27abs ↗pdf ↗

New linear flows using exponential of linear transformations improve generative models.

problem Improving generative models in machine learning.
method Developed convolution exponentials and generalized Sylvester Flows using the exponential of linear transformations.
result Convolution exponentials and Convolutional Sylvester Flows outperform other models in log-likelihood.

End-to-end neural network based approaches to audio modelling are generally outperformed by models trained on high-level data representations. In this paper we present preliminary work that shows the feasibility of training the first layers of a deep convolutional neural network (CNN) model to learn the commonly-used l…

2017-12-01abs ↗pdf ↗

The paper revisits expected signatures in semimartingale models, providing new formulae and simplifying complexity.

problem Computing expected signatures in semimartingale models.
method Revisits and provides new formulae for computing expected signatures in a general semimartingale setting.
result Log-transform of expected signatures simplifies complexity, leading to signature cumulants.

Analytical pricing formulas and Greeks are obtained for European and American basket put options using Mellin transforms. We assume assets are driven by geometric Brownian motion which exhibit correlation and pay a continuous dividend rate. A novel approach to numerical Mellin inversion is achieved via the fast Fourier…

2014-03-15abs ↗pdf ↗

New lower bounds improve logistic log-likelihood optimization and inference.

problem Designing computationally tractable lower bounds for logistic log-likelihoods.
method Developed a piece-wise quadratic lower bound that uniformly improves tangent quadratic minorizers.
result Improves the speed of convergence and accuracy of variational Bayes approximations.

This paper compares Transformers and RNNs in various tasks, showing size differences.

problem Comparing representational capabilities of Transformers and RNNs across tasks.
method Analysis of differences in tasks like index lookup, nearest neighbor, and string equality.
result Size differences in Transformers and RNNs for various tasks.

A new method uses Transformers for efficient prediction of marked point processes.

problem Efficiently predicting the next event in a sequence given its history.
method Modeling conditional inter-event times with a mixture of log-normals and marks with a Transformer architecture.
result The method achieves state-of-the-art performance and is faster during inference.

Transformation models are a very important tool for applied statisticians and econometricians. In many applications, the dependent variable is transformed so that homogeneity or normal distribution of the error holds. In this paper, we analyze transformation models in a high-dimensional setting, where the set of potent…

2017-12-20abs ↗pdf ↗

Study of circle homeomorphisms with square summable diamond shears.

problem Characterizing circle homeomorphisms with specific summability properties.
method Analysis of homeomorphisms in modular coordinates and comparison to Weil-Petersson class.
result Sharp results comparing new class to Weil-Petersson class and Hölder classes.

We aim to model unknown file processing. As the content of log files often evolves over time, we established a dynamic statistical model which learns and adapts processing and parsing rules. First, we limit the amount of unstructured text by focusing only on those frequent patterns which lead to the desired output tabl…

2020-01-05abs ↗pdf ↗

Exposes new connections between weighted Kähler-Ricci solitons and Ricci-flat Kähler cone metrics.

problem Exploring connections between weighted Kähler-Ricci solitons and Ricci-flat Kähler cone metrics.
method Surveying and reviewing recent works, transforming complex Monge-Ampère equations, and proving the YTD conjecture.
result Established a transformation from irregular Sasaki-Einstein metrics to gg-solitons on quasi-regular quotients.

This paper is the first arising from our project announced in math.AG/0211094, "Affine manifolds, log structures, and mirror symmetry." We aim to study mirror symmetry by studying the log structures of Illusie-Fontaine and Kato on degenerations of Calabi-Yau manifolds. The basic idea is that one can associate to certai…

2003-09-04abs ↗pdf ↗

The square root of Fredholm determinants causes numerical instabilities in option pricing models.

problem Numerical instabilities in Fourier-based option pricing for the Volterra Stein-Stein model.
method Characterization of determinant crossing behavior, derivation of transform to handle crossings, efficient algorithms.
result Significant improvement in accuracy and reduction in computational cost for Fourier-based pricing.

GBHT uses gradient boosting for density estimation with theoretical guarantees.

problem Density estimation for unsupervised learning.
method Gradient Boosting Histogram Transform (GBHT) with Negative Log Likelihood loss.
result GBHT achieves faster convergence rates and better performance than base learners in density estimation.

Large Transformer models routinely achieve state-of-the-art results on a number of tasks but training these models can be prohibitively costly, especially on long sequences. We introduce two techniques to improve the efficiency of Transformers. For one, we replace dot-product attention by one that uses locality-sensiti…

2020-01-13abs ↗pdf ↗

Transformers approximate Bayesian posteriors but not exactly.

problem Bayesian accounts of in-context learning face challenges due to task-preserving order changes in transformers.
method Showed that excess prequential code length is exactly cumulative predictive KL, decomposing expected regret into order-averaged predictor and order-averaging gain.
result Transformers approximate Bayesian posteriors but not exactly, priced by log loss.

Develops a functional generalization of Eldan's stochastic localization for optimization and privacy.

problem Sampling under non-Euclidean geometries and optimization in differential privacy.
method Functional generalization of Eldan's stochastic localization, incorporating log-Laplace transform.
result Improves query complexities in zeroth-order differential private convex optimization.

Log-Normal Multiplicative Dynamics improves low-precision training of neural networks.

problem Training large neural networks with low precision is unstable.
method Derive a Bayesian learning rule with log-normal posterior distributions and multiplicative updates.
result LMD achieves stable and accurate training for Vision Transformer and GPT-2.

Study large deviations in fractional volatility models with non-Gaussian volatility.

problem Large deviations in fractional volatility models with non-Gaussian volatility.
method Established a small-noise large deviation principle for log-price.
result Logarithmic call price asymptotics for large strikes in a special case.

Study develops ensemble machine learning framework for predicting groundwater heavy metal pollution.

problem Statistical complexity and spatial heterogeneity of heavy metal contamination in groundwater.
method Nested cross-validated ensemble machine learning with response transformations (raw, log, Gaussian copula).
result Copula-based models with DBSCAN clustering diagnostics provide the most reliable and interpretable assessments of groundwater contamination.