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

74147221294 · Jun 202019922001200920172026
48 results for random drop

Random walks on Fuchsian Schottky groups have harmonic measures with lower dimension.

problem Understanding the dimensionality of harmonic measures for random walks.
method Analyzing finite range random walks on Fuchsian Schottky groups.
result Harmonic measures have dimension strictly less than the limit set's Hausdorff dimension.

In this paper we study the learnability of deep random networks from both theoretical and practical points of view. On the theoretical front, we show that the learnability of random deep networks with sign activation drops exponentially with its depth. On the practical front, we find that the learnability drops sharply…

2019-04-08abs ↗pdf ↗

Dropout is often used in deep neural networks to prevent over-fitting. Conventionally, dropout training invokes \textit{random drop} of nodes from the hidden layers of a Neural Network. It is our hypothesis that a guided selection of nodes for intelligent dropout can lead to better generalization as compared to the tra…

2018-12-10abs ↗pdf ↗

Proposes MIP, a privacy notion that requires less randomness than DP, leading to better utility.

problem Preserving privacy in machine learning models with sensitive data.
method Introduces membership inference privacy (MIP) as a new privacy notion and shows its relationship with differential privacy (DP).
result MIP can be achieved with less randomness than DP, resulting in better utility.

This paper analyzes the configurations of shapes that shows a spacelike liquid drop in Minkowski space deposited over a spacelike plane ΠΠ. We assume the presence of a uniform gravity field directed toward ΠΠ and that the volume of the drop is prescribed. Our interest are the liquid drops that are critical points of …

2005-01-12abs ↗pdf ↗

Deep neural networks have dramatically achieved great success on a variety of challenging tasks. However, most successful DNNs have an extremely complex structure, leading to extensive research on model compression.As a significant area of progress in model compression, traditional gradual pruning approaches involve an…

2018-12-05abs ↗pdf ↗

Deep neural networks (DNNs) have been proven to have many redundancies. Hence, many efforts have been made to compress DNNs. However, the existing model compression methods treat all the input samples equally while ignoring the fact that the difficulties of various input samples being correctly classified are different…

2018-07-04abs ↗pdf ↗

The training phases of Deep neural network~(DNN) consumes enormous processing time and energy. Compression techniques utilizing the sparsity of DNNs can effectively accelerate the inference phase of DNNs. However, it can be hardly used in the training phase because the training phase involves dense matrix-multiplicatio…

2018-05-23abs ↗pdf ↗

A new variable importance measure for DRFs detects broader impacts on output distributions.

problem Estimating full conditional distributions of multivariate outputs given inputs.
method Based on the drop and relearn principle and MMD distance.
result Consistent and high-performing variable importance measure for DRFs.

Study reveals LLM personas have two distinct components: frame-robust aggregated traits and frame-dependent geometric features.

problem Evaluation of LLM personas via psychometric questionnaires discards within-instance correlation structure.
method Constructed within-instance correlation matrices from IPIP-50 responses and analyzed geometry on SPD manifolds under manipulated question orderings.
result Persona expression comprises two dissociable components: aggregated features (Big Five scores) and geometric features (SPD manifold).

The Frank-Wolfe (FW) algorithm has been widely used in solving nuclear norm constrained problems, since it does not require projections. However, FW often yields high rank intermediate iterates, which can be very expensive in time and space costs for large problems. To address this issue, we propose a rank-drop method …

2017-04-13abs ↗pdf ↗

New hyperparameter ensembles boost neural network performance and uncertainty.

problem Improving neural network robustness and uncertainty quantification.
method Designing ensembles over both weights and hyperparameters, stratified across random initializations.
result Hyper-deep and hyper-batch ensembles outperform deep and batch ensembles on various architectures.

Recent advances in machine learning (ML) algorithms, especially deep neural networks (DNNs), have demonstrated remarkable success (sometimes exceeding human-level performance) on several tasks, including face and speech recognition. However, ML algorithms are vulnerable to \emph{adversarial attacks}, such test-time, tr…

2020-03-03abs ↗pdf ↗

In this work, we leverage advances in sparse coding techniques to reduce the number of trainable parameters in a fully connected neural network. While most of the works in literature impose 1\ell_1 regularization, DropOut or DropConnect techniques to induce sparsity, our scheme considers feature importance as a criter…

2019-07-03abs ↗pdf ↗

Lower Ricci curvature bound prevents first Betti number from dropping more than dimension in collapsing manifolds.

problem Understanding how the first Betti number behaves under manifold collapse with Ricci curvature bounds.
method Analyzing sequences of Riemannian manifolds with lower Ricci curvature bounds.
result The first Betti number cannot drop more than the dimension in collapsing manifolds.

Randomly chosen primary hidden units and derived secondary units reduce neural network complexity.

problem Large number of hidden units in neural networks.
method Introducing primary and secondary hidden units with random weights for primary units and derived weights for secondary units.
result Significant reduction in the number of hidden units without compromising accuracy.

Recent studies have revealed the vulnerability of deep neural networks: A small adversarial perturbation that is imperceptible to human can easily make a well-trained deep neural network misclassify. This makes it unsafe to apply neural networks in security-critical applications. In this paper, we propose a new defense…

2017-12-02abs ↗pdf ↗

Out-of-distribution (OOD) detection approaches usually present special requirements (e.g., hyperparameter validation, collection of outlier data) and produce side effects (e.g., classification accuracy drop, slower energy-inefficient inferences). We argue that these issues are a consequence of the SoftMax loss anisotro…

2019-08-15abs ↗pdf ↗

Study on stability of 3D sessile drops, identifying degenerate kernel.

problem Linear stability of three-dimensional sessile drops with a free contact line.
method Derived constrained second variation, formulated Jacobi problem, combined geometric and Fourier analysis.
result Kernel of the constrained Jacobi operator is exactly the space of horizontal translations under pressure-volume nondegeneracy.

Dropout is a simple yet effective algorithm for regularizing neural networks by randomly dropping out units through Bernoulli multiplicative noise, and for some restricted problem classes, such as linear or logistic regression, several theoretical studies have demonstrated the equivalence between dropout and a fully de…

2017-10-10abs ↗pdf ↗

New method trains generative models without discriminators, improving stability and accuracy.

problem Training implicit generative models with adversarial discriminators leads to instability and mode-dropping.
method Invariant statistical loss function, avoiding discriminators.
result Successfully trains generative models for various complex distributions without mode-dropping.

We study the dynamic evolution of cross-correlations in the Chinese stock market mainly based on the random matrix theory (RMT). The correlation matrices constructed from the return series of 367 A-share stocks traded on the Shanghai Stock Exchange from January 4, 1999 to December 30, 2011 are calculated over a moving …

2013-08-06abs ↗pdf ↗

We establish explicit socially optimal rules for an irreversible investment deci- sion with time-to-build and uncertainty. Assuming a price sensitive demand function with a random intercept, we provide comparative statics and economic interpreta- tions for three models of demand (arithmetic Brownian, geometric Brownian…

2014-05-31abs ↗pdf ↗

We study the long time existence theory for a non local flow associated to a free boundary problem for a trapped non liquid drop. The drop has free boundary components on two horizontal plates and its free energy is anisotropic and axially symmetric. For axially symmetric initial surfaces with sufficiently large volume…

2011-10-31abs ↗pdf ↗

Critical volatility triggers log-normal to power-law transitions in interconnected systems.

problem Understanding the transition from log-normal to power-law distributions in interconnected systems.
method Analyzing an infinite option-on-option chain model, deriving a critical volatility threshold.
result A critical volatility threshold of approximately 250.66% for unconditional cases, dropping to 125.3% with selective survival.

Dropping a tiny fraction of preferences can significantly alter the rankings of top LLMs.

problem Robustness of LLM ranking systems to small changes in preference data.
method A computational method based on the Bradley-Terry model to evaluate robustness.
result Top LLM rankings can be highly sensitive to the removal of a small fraction of preferences.