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

15314661 · May 202619922001200920172026
48 results for train-validation split

This paper explores how train-validation splits help in NAS to prevent overfitting.

problem NAS overfits with train-validation splits and needs better generalization guarantees.
method Established refined properties of validation loss and risk for NAS.
result NAS with train-validation splits can select the most generalizable model.

Reshuffling splits improves hyperparameter optimization's generalization performance.

problem Improving peak performance of machine learning models through better hyperparameter optimization.
method Reshuffling splits for every hyperparameter configuration improves generalization performance.
result Reshuffling leads to better generalization performance compared to fixed splits.

Semi-supervised node classification in graphs is a fundamental problem in graph mining, and the recently proposed graph neural networks (GNNs) have achieved unparalleled results on this task. Due to their massive success, GNNs have attracted a lot of attention, and many novel architectures have been put forward. In thi…

2018-11-14abs ↗pdf ↗

Proposes a method to compute valid lower confidence bounds for multiple models selected based on their performance.

problem Model selection and evaluation in machine learning.
method Interprets model selection as a simultaneous inference problem, uses bootstrap tilting and maxT-type multiplicity correction.
result Yields valid lower confidence bounds that are at least as good as standard approaches and reliably reach nominal coverage probability.

Protein modeling is an increasingly popular area of machine learning research. Semi-supervised learning has emerged as an important paradigm in protein modeling due to the high cost of acquiring supervised protein labels, but the current literature is fragmented when it comes to datasets and standardized evaluation tec…

2019-06-19abs ↗pdf ↗

PHBench predicts Series A funding from Product Hunt launch signals with 7.8% accuracy.

problem Predicting startup Series A funding from launch signals on Product Hunt.
method Constructed PHBench from 67,292 Product Hunt posts, linked to funding records, and used a three-component ensemble model.
result Best-performing model achieved F0.5 = 0.097 and AP = 0.037, with a statistically significant advantage over logistic regression.

A RL framework for hedging equity index options with realistic costs.

problem Dynamic hedging of equity index option exposures under transaction costs.
method Reinforcement Learning (RL) with a leak-free environment, cost-aware reward function, and stochastic actor-critic agent.
result The RL policy improves risk-adjusted performance compared to no-hedge, momentum, and volatility-targeting baselines.

Transformer models outperform LSTM in financial forecasting with MADL loss.

problem Optimizing loss functions for Transformer models in financial forecasting.
method Empirical experiments with MADL loss function on equity and cryptocurrency assets.
result Transformer models significantly outperform LSTM models in financial forecasting.

A co-evolutionary approach for Heston model calibration reduces overfitting with diverse datasets.

problem Overfitting and lack of generalization in Heston model calibration.
method Coupling a genetic algorithm with an evolving neural inverse map, using both GA-history sampling and Latin hypercube sampling.
result Diverse datasets improve out-of-sample stability and calibration accuracy.

SPlit optimizes dataset splitting for better model performance.

problem Improving model performance through optimal dataset splitting.
method Adapting Support Points (SP) algorithm for subsampling and categorical variables in a sequential nearest neighbor approach.
result SPlit significantly improves worst-case testing performance compared to random splitting.

The paper extends keenness concept to bridge splittings and finds conditions for existence.

problem Extending keenness concept to bridge splittings and finding conditions for existence.
method Extending the concept of keenness to bridge splittings and proving existence conditions.
result Existence of strongly keen (g,b)(g,b)-splitting of a link with distance nn for certain integers gg, bb, and nn.

Non-split almost complex supermanifolds and non-split Riemannian supermanifolds are studied. The first obstacle for a splitting is parametrized by group orbits on an infinite dimensional vector space. Further it is shown that non-split structures appear in the first case as deformations of a split reduction and in the …

2015-01-28abs ↗pdf ↗

We study the self-dual Yang-Mills equations in split signature. We give a special solution, called the basic split instanton, and describe the ADHM construction in the split signature. Moreover a split version of t'Hooft ansatz is described.

2009-02-03abs ↗pdf ↗

Paper proposes a novel SVM method for creating survival trees.

problem Creating non-linear survival trees for right-censored data.
method L2-regularized dipole splitting criteria with kernel methods.
result Non-linear splits using polynomial and Gaussian kernels show similar predictive power but often smaller tree sizes.

New methods improve prediction regions for high-dimensional data.

problem Creating effective prediction regions for high-dimensional data.
method CD-split and HPD-split methods that combine split method and data-driven partition.
result CD-split and HPD-split converge to oracle highest predictive density set and satisfy local and asymptotic conditional validity.

We show that if a split link is obtained from a split link LL in S3S^3 by 1/n1/n-Dehn surgery along a trivial knot CC, then the link LCL\cup C is splittable. That is to say, it is impossible to obtain a split link from a split link via a non-trivial twisting. As its corollary, we completely determine when a trivial li…

2001-04-24abs ↗pdf ↗

Deep learning models are full of hyperparameters, which are set manually before the learning process can start. To find the best configuration for these hyperparameters in such a high dimensional space, with time-consuming and expensive model training / validation, is not a trivial challenge. Bayesian optimization is a…

2019-12-11abs ↗pdf ↗

The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering links and Alexander invariants. As an application, we completely determine the sp…

2013-08-26abs ↗pdf ↗

Safe-EF improves federated learning for non-smooth, constrained optimization.

problem Federated learning's communication bottlenecks with high-dimensional model updates.
method Error feedback (EF) for non-smooth convex optimization with safety constraints.
result Safe-EF matches lower complexity bounds and ensures safety constraints.

Little is known on the classification of Heegaard splittings for hyperbolic 3-manifolds. Although Kobayashi gave a complete classification of Heegaard splittings for the exteriors of 2-bridge knots, our knowledge of other classes is extremely limited. In particular, there are very few hyperbolic manifolds that are know…

2007-09-14abs ↗pdf ↗

New proof of Giroux Correspondence for tight contact 3-manifolds.

problem Proving the Giroux Correspondence for tight contact 3-manifolds.
method Introducing tight Heegaard splittings, using refinement process, and translating moves between splittings to moves between open books.
result Proves the tight Giroux Correspondence for contact 3-manifolds.

Non-isotopic Heegaard splittings of non-minimal genus were known previously only for very special 3-manifolds. We show in this paper that they are in fact a wide spread phenomenon in 3-manifold theory: We exhibit a large class of knots and manifolds obtained by Dehn surgery on these knots which admit such splittings. M…

1998-03-03abs ↗pdf ↗

Neural network has attracted great attention for a long time and many researchers are devoted to improve the effectiveness of neural network training algorithms. Though stochastic gradient descent (SGD) and other explicit gradient-based methods are widely adopted, there are still many challenges such as gradient vanish…

2020-02-10abs ↗pdf ↗

We define a notion of Hempel distance for one-sided Heegaard splittings and show that the existence of alternate surfaces restricts distance for one-sided splittings in a manner similar to Hartshorn's and Scharlemann-Tomova's results for two-sided splittings. We also show that every geometrically compressible one-sided…

2011-12-02abs ↗pdf ↗

Casson and Gordon gave the rectangle condition for strong irreducibility of Heegaard splittings [1]. We give a parity condition for irreducibility of Heegaard splittings of irreducible manifolds. As an application, we give examples of non-stabilized Heegaard splittings by doing a single Dehn twist.

2008-12-01abs ↗pdf ↗