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

Trend · papers per month

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for doubly growing epochs

A new method for sparse linear bandits reduces exploration-exploitation tradeoff.

problem Sparse linear bandits in high-dimensional settings with finite actions.
method Best subset selection for parameter estimation and doubly growing epochs for regret minimization.
result Achieves nearly dimension-independent regret of ildeO(sT) ilde{\mathcal{O}}(s\sqrt{T}) with high probability.

SPARKLE handles high-dimensional covariates for online decision-making.

problem Complex reward-covariate relationships in high-dimensional settings.
method SPARKLE uses a sparse additive reward model with doubly penalized estimator and adaptive screening.
result SPARKLE achieves sublinear regret bound logarithmic in covariate dimensionality.

Paper proposes Sinkformers for Transformers with doubly stochastic attention.

problem Improving Transformer models' accuracy in vision and natural language processing.
method Using Sinkhorn's algorithm to make attention matrices doubly stochastic instead of SoftMax normalization.
result Sinkformers enhance model accuracy in vision and natural language processing tasks.

The paper analyzes how repeating epochs affects data scaling in linear regression.

problem Understanding how to scale data for multi-epoch training in linear regression.
method Theoretical analysis of effective reuse rate (E(K, N)) under strong convexity or Zipf-distributed data.
result The effective reuse rate E(K, N) plateaus at a problem-dependent value that grows with N, indicating diminishing marginal gains.

New estimator improves ATT estimation efficiency with external controls.

problem Reduced efficiency when incorporating external controls into ATT estimation.
method Proposes a novel doubly robust estimator for ATT that maintains higher efficiency than standard approaches.
result Demonstrates improved efficiency of the new estimator compared to standard approaches, even under model misspecification.

Adam optimizer's bias is influenced by mini-batch size and momentum hyperparameters.

problem Understanding how Adam's implicit bias is affected by mini-batch size and momentum parameters.
method Theoretical framework to analyze mini-batch noise's impact on Adam's memory and bias.
result The magnitude of anti-regularization by memory depends on batch size and momentum hyperparameters.

Recent neural network and language models rely on softmax distributions with an extremely large number of categories. Since calculating the softmax normalizing constant in this context is prohibitively expensive, there is a growing literature of efficiently computable but biased estimates of the softmax. In this paper …

2018-03-22abs ↗pdf ↗

Study optimal policy regret in partially observable Markov games with adaptive opponents.

problem Optimal sequential decision-making in partially observable environments against strategic, adaptive opponents.
method An epoch-based optimistic maximum-likelihood algorithm that selects one policy per epoch using confidence sets built cumulatively from past data.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) policy regret for fixed problem parameters, with explicit dependence on horizon, adversary memory, confidence radius, and aggregate Eluder dimension.

Few-shot learning aims to train efficient predictive models with a few examples. The lack of training data leads to poor models that perform high-variance or low-confidence predictions. In this paper, we propose to meta-learn the ensemble of epoch-wise empirical Bayes models (E3BM) to achieve robust predictions. "Epoch…

2019-04-17abs ↗pdf ↗

Nowadays, deep learning can be employed to a wide ranges of fields including medicine, engineering, etc. In deep learning, Convolutional Neural Network (CNN) is extensively used in the pattern and sequence recognition, video analysis, natural language processing, spam detection, topic categorization, regression analysi…

2018-09-17abs ↗pdf ↗

New method shows hidden state can significantly improve differential privacy in SGD.

problem Differential privacy in SGD with hidden state.
method Proves converging privacy bounds for hidden state SGD, using privacy amplification techniques.
result Privacy bound converges exponentially fast and is smaller than composition bounds.

New algorithm tackles subgroup fairness in AI with multiple sensitive attributes.

problem Heavy computational burdens and data sparsity in subgroup fairness for multiple sensitive attributes.
method Doubly Regressing Adversarial learning (DRAF) for subgroup fairness, focusing on subgroups with sufficient sample sizes and marginal fairness.
result DRAF algorithm reduces a surrogate fairness gap for supIPM with less computation than directly reducing supIPM.

Epoch-GDA achieves optimal convergence rate for SCSC min-max problems.

problem Solving stochastic min-max problems with strong convexity and strong concavity.
method Epoch-wise stochastic gradient descent ascent method (Epoch-GDA) without additional assumptions.
result Achieves the optimal rate of O(1/T)O(1/T) for the duality gap of general SCSC min-max problems.

This paper tackles overfitting in CTR models by introducing Multi-Epoch learning with Data Augmentation.

problem Overfitting of the embedding layer in CTR models during multi-epoch training.
method Introduces Multi-Epoch learning with Data Augmentation (MEDA) framework to reduce overfitting and enhance performance.
result MEDA minimizes overfitting and achieves data augmentation through varied embedding spaces, improving performance without overfitting.

The paper examines Einstein doubly warped product manifolds with a semi-symmetric metric connection.

problem Characterizing Einstein doubly warped product manifolds with a semi-symmetric metric connection.
method Deriving curvature formulas and proving necessary and sufficient conditions for a manifold to be a warped product.
result Obtained results for Einstein doubly warped product manifolds and Einstein-like doubly warped product manifolds.

This paper extends ResNet theory to infinitely deep networks, linking them to diffusion processes.

problem Training infinitely deep ResNets with i.i.d. initializations leads to undesirable properties.
method Introduced doubly infinite ResNets with i.i.d. initializations, linking to diffusion processes.
result The dynamics of quantities of interest converge to deterministic limits in the limit of infinite depth.

In unsupervised learning, collecting more data is not always a costly process unlike the training. For example, it is not hard to enlarge the 40GB WebText used for training GPT-2 by modifying its sampling methodology considering how many webpages there are in the Internet. On the other hand, given that training on this…

2019-06-16abs ↗pdf ↗

Characterizes and examines gradient solitons on doubly warped product manifolds.

problem Understanding gradient solitons on specific manifold structures.
method Characterizations and examinations of various types of gradient solitons on doubly warped product manifolds.
result Effects of gradient solitons on factor manifolds and specific curvature properties of doubly warped products.

This paper explains double descent in linear neural networks, identifying new factors.

problem Understanding double descent in linear neural networks.
method Gradient flow derivation and necessary conditions for double descent.
result Singular values of input-output covariance matrix are important for double descent in two-layer models.

We show that if the connected sum of two knots with coprime Alexander polynomials is doubly slice, then the Ozsváth-Szabó correction terms as smooth double sliceness obstructions vanish for both knots. Recently, Jeffrey Meier gave smoothly slice knots that are topologically doubly slice, but not smoothly doubly slice. …

2016-11-23abs ↗pdf ↗

Paper develops a new estimator for dynamic treatment effects in high-dimensional settings.

problem Time-varying confounding and model misspecification in estimating dynamic treatment effects.
method Sequential model doubly robust estimator with moment-targeting estimates.
result Root-N inference achieved under model misspecification, even with high-dimensional covariates.

We define an obstruction for a knot to be Z[Z]-homology ribbon, and use this to provide restrictions on the integers that can occur as the triple linking numbers of derivative links of knots that are either homotopy ribbon or doubly slice. Our main application finds new non-doubly slice knots. In particular this gives …

2018-02-02abs ↗pdf ↗

Deep learning models can initially degrade in performance as they grow larger, then improve.

problem Performance degradation of larger models and more data.
method Defined effective model complexity and identified double descent phenomenon.
result Increasing model size and data can initially hurt performance, contrary to intuition.

In this paper we study fundamental geometric properties of doubly warped product immersion which is an extension of warped product immersion. Moreover, we study geometric inequality for doubly warped products isometrically immersed in arbitrary Riemannian manifolds.

2013-10-05abs ↗pdf ↗

We construct an infinite family of smoothly slice knots that we prove are topologically doubly slice. Using the correction terms coming from Heegaard Floer homology, we show that none of these knots is smoothly doubly slice. We use these knots to show that the subgroup of the double concordance group consisting of smoo…

2014-01-06abs ↗pdf ↗

The twisting number of a ribbon knot is at least as large as its doubly slice genus.

problem Proving a lower bound for the twisting number of ribbon knots in terms of their doubly slice genus.
method Analyzing symmetric unions and tangle replacements to establish the bound.
result Ribbon knots have arbitrarily high twisting numbers, matching their doubly slice genus.

In this paper, we introduce horizontal and vertical warped product Finsler manifold. We prove that every C-reducible or proper Berwaldian doubly warped product Finsler manifold is Riemannian. Then, we find the relation between Riemmanian curvatures of doubly warped product Finsler manifold and its components, and consi…

2011-10-31abs ↗pdf ↗