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

7.5%15.0%22.5%30.0% · May 199519922001200920172026
48 results for initiation techniques

Re-initializing neural networks improves generalization but not as much as other techniques.

problem Understanding when and how re-initialization improves neural network performance.
method Empirical comparison of re-initialization with standard training and various regularization techniques.
result Re-initialization is beneficial for generalization but not as much as other techniques, especially when combined with careful tuning of hyperparameters.

New initialization techniques improve the performance and speed of EMI sensor-based object discrimination.

problem Improving the performance and speed of EMI sensor-based object discrimination.
method Proposed and evaluated new initialization techniques for MI-ACE.
result Comparison of initialization approaches shows improved performance and speed.

Paper proves new inequalities for Einstein-Maxwell data sets.

problem Establishing area-charge inequalities for Einstein-Maxwell initial data sets.
method Applying Gromov's μ-bubble technique in a new geometric context.
result Novel rigidity theorems for noncompact Einstein-Maxwell data sets.

We describe a proof of M.T. Anderson's result on the rigidity of complete stationary initial data for the Einstein vacuum equations in spacetime dimension 3 + 1, under an extra assumption on the norm of the stationary Killing vector field. The argument only involves basic comparison geometry along with some Bochner-Wei…

2014-02-04abs ↗pdf ↗

Spectral normalization stabilizes GANs by controlling gradient explosion and vanishing.

problem Stability and sample quality issues in GAN training.
method Spectral normalization controls gradient explosion and vanishing, improving GAN training stability and sample quality.
result Bidirectional Scaled Spectral Normalization (BSSN) outperforms standard spectral normalization in sample quality and training stability.

MIK improves t-SNE's local structure preservation in biological sequence data.

problem Efficiently preserving local structure in high-dimensional biological sequence data.
method Modified Isolation Kernel (MIK) using adaptive density estimation.
result MIK preserves local and global structure better than Gaussian and isolation kernels.

Proposes a method to optimize neural network initialization using marginal likelihood maximization.

problem Optimizing hyperparameters for neural network initialization.
method Leverages the connection between neural networks and Gaussian processes to infer optimal hyperparameters.
result Marginal likelihood maximization provides near-optimal prediction performance on MNIST classification tasks.

Paper presents robust clustering methods for general mixture models.

problem Clustering with sub-Gaussian error assumptions often invalid in practice.
method Hybrid clustering with robust centroid estimate and data-driven initialization.
result Provably near-optimal mislabeling guarantees for general error distributions.

Initial margin requirements are becoming an increasingly common feature of derivative markets. However, while the valuation of derivatives under collateralisation (Piterbarg 2010, Piterbarg2012), under counterparty risk with unsecured funding costs (FVA) (Burgard2011, Burgard2011, Burgard2013) and in the presence of re…

2014-05-02abs ↗pdf ↗

Paper uses Chebyshev Tensors for accurate dynamic sensitivities and ISDA SIMM computation.

problem Computing dynamic sensitivities and initial margin for financial instruments.
method Uses Chebyshev Tensors in Monte Carlo simulations to compute dynamic sensitivities and ISDA SIMM.
result High accuracy and computational gains for FX swaps and Spread Options.

The paper tackles fVaR prediction methods in finance.

problem Predicting future values at risk (fVaR) in finance.
method Various methods including Nested MC-empirical quantile, percentiles from distributions, quantile regressions, and limited inner simulations.
result Improved methods for predicting fVaRs, including those that are computationally efficient.

Improved LLM pre-training performance through better weight and variance control.

problem Improper weight and variance control in LLM pre-training affects downstream task performance.
method Introduced Layer Index Rescaling (LIR) and Target Variance Rescaling (TVR) techniques.
result Substantial improvements in downstream task performance (up to 4.6%) and reduced extreme activation values.

This work investigates the ways in which deep learning methods can benefit from random projection (RP), a classic linear dimensionality reduction method. We focus on two areas where, as we have found, employing RP techniques can improve deep models: training neural networks on high-dimensional data and initialization o…

2018-12-22abs ↗pdf ↗

Study peels tensor equations on Schwarzschild spacetime.

problem Analyzing the asymptotic behavior of tensorial wave equations on Schwarzschild spacetime.
method Combining conformal compactification and vector field techniques to estimate tensorial field energies.
result Obtains optimal initial data for peeling at all orders.

This is the first in a series Of papers in which we initiate the study Of very rough solutions to the initial value problem for the Einstein Vacuum equations expressed relative to wave coordinates. By very rough we mean solutions which cannot be constructed by the classical techniques Of energy estimates and Sobolev in…

2001-09-23abs ↗pdf ↗

Proposes a novel approach for deep neural network initialization using polynomial approximations.

problem Improving deep neural network training from initialization.
method Uses polynomial-based approximations to initialize deep neural networks.
result Networks initialized with polynomial approximations are more likely to achieve a desirable local minimum during training.

K-Means clustering improved with sophisticated initialisation techniques.

problem K-Means algorithm's sensitivity to initial centroid positions and local minima.
method Comparison of deterministic and stochastic initialisation techniques for K-Means variations.
result Deterministic methods outperform stochastic methods in clustering quality.

We show that there exists a suitable neighborhood of a constant curvature hyperbolic metric such that, for all initial data in this neighborhood, the corresponding solution to a normalized cross curvature flow exists for all time and converges to a hyperbolic metric. We show that the same technique proves an analogous …

2006-09-27abs ↗pdf ↗

This article, written to appear as a chapter in "The Springer Handbook of Spacetime", is a review of the initial value problem for Einstein's gravitational field theory in general relativity. Designed to be accessible to graduate students who have taken a first course in general relativity, the article first discusses …

2013-04-07abs ↗pdf ↗

New technique trains deep neural networks without normalization or minibatch statistics.

problem Training deep neural networks at high learning rates without normalization.
method Channel-wise zero-mean initialization and gradient modification to maintain common mode rejection.
result Achieves higher accuracy compared to batch normalization and shows minibatches are unnecessary.

Improves deep neural network training and accuracy with adaptive basis approach.

problem Gap between theoretical and practical performance of deep neural networks.
method Adaptive basis viewpoint, novel initializations, hybrid optimizer.
result Dramatic increases in accuracy and convergence rate for various DNN applications.

Trained neural networks perform Bayesian reasoning for tasks beyond their initial scope.

problem Performing Bayesian reasoning for tasks outside the trained neural networks' initial scope.
method Used deep generative models as priors and classification/regression networks as constraints. Approximated Bayesian inference through variational or sampling techniques.
result The approach built on top of already trained networks, expanding the addressable questions.

This is the second in a series of three papers in which we initiate the study of very rough solutions to the initial value problem for the Einstein vacuum equations expressed relative to wave coordinates. By very rough we mean solutions which cannot be constructed by the classical techniques of energy estimates and Sob…

2001-09-23abs ↗pdf ↗

Training recurrent neural networks (RNNs) on long sequence tasks is plagued with difficulties arising from the exponential explosion or vanishing of signals as they propagate forward or backward through the network. Many techniques have been proposed to ameliorate these issues, including various algorithmic and archite…

2019-01-25abs ↗pdf ↗

New method improves BO's AF maximizer initialization for high-dimensional problems.

problem Challenges in maximizing acquisition functions in high-dimensional Bayesian optimization.
method Proposes a heuristic optimizer-based initialization approach to improve AF maximizer performance.
result Our approach significantly enhances BO performance in most test cases.

A new design methodology for neural networks that is guided by traditional algorithm design is presented. To prove our point, we present two heuristics and demonstrate an algorithmic technique for incorporating additional weights in their signal-flow graphs. We show that with training the performance of these networks …

2018-06-06abs ↗pdf ↗

We use numerical techniques to study the formation of singularities in Ricci flow. Comparing the Ricci flows corresponding to a one parameter family of initial geometries on S^3 with varying amounts of S^2 neck pinching, we find critical behavior at the threshold of singularity formation.

2003-06-07abs ↗pdf ↗

Gradient descent proves global convergence for 4-layer matrix factorization.

problem Global convergence of gradient descent on four-layer matrix factorization under random initialization.
method New techniques to show saddle-avoidance properties and extend eigenvalue theories.
result Polynomial-time global convergence guarantee for randomly initialized gradient descent on four-layer matrix factorization.

In this paper, we study the problem of expected utility maximization of an agent who, in addition to an initial capital, receives random endowments at maturity. Contrary to previous studies, we treat as the variables of the optimization problem not only the initial capital but also the number of units of the random end…

2004-05-14abs ↗pdf ↗