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.
A new method for computing image curvature efficiently and accurately.
A new term weighting scheme TF-IDFC-RF outperforms others in sentiment analysis.
Paper explores weighted averaging schemes for SGD, achieving asymptotic normality and optimality.
A new method uses nearest neighbors for importance weighting.
CWAN tackles multi-source heterogeneous domain adaptation with conditional weighting.
Paper tackles model collapse in recursive generative models using a weighted training scheme.
A new machine learning method solves high-dimensional Kolmogorov PDEs efficiently.
Proves existence of curves with constant curvature in a sphere.
This paper analyzes SGD with increasingly weighted averaging for optimization and generalization.
Real-world large-scale datasets usually contain noisy labels and are imbalanced. Therefore, we propose derivative manipulation (DM), a novel and general example weighting approach for training robust deep models under these adverse conditions. DM has two main merits. First, loss function and example weighting are commo…
We derive valuations of a portfolio of financial instruments from a securities lending perspective, under different assumptions, and show a weighting scheme that converges to the true valuation. We illustrate conditions under which our alternative weighting scheme converges faster to the true valuation when compared to…
Unweighted matrix factorization can match or outperform weighted methods in recommender systems.
We discuss a weighted estimation of correlation and covariance matrices from historical financial data. To this end, we introduce a weighting scheme that accounts for similarity of previous market conditions to the present one. The resulting estimators are less biased and show lower variance than either unweighted or e…
The paper explores when to prioritize easy or hard samples in learning tasks.
Enhances trading signals using image analysis and weighted moving averages.
Improves Gower's similarity for mixed-type variables with automatic weighting.
We propose and analyze a variant of the classic Polyak-Ruppert averaging scheme, broadly used in stochastic gradient methods. Rather than a uniform average of the iterates, we consider a weighted average, with weights decaying in a geometric fashion. In the context of linear least squares regression, we show that this …
Neural networks learn task-specific features, influenced by nonlinearity.
Based on the property that solving the system of linear matrix equations via the column space and the row space projections boils down to an approximation in the least squares error sense, a formulation for learning the weight matrices of the multilayer network can be derived. By exploiting into the vast number of feas…
Constraints improve deep neural network training by stabilizing and enhancing robustness.
Bayesian models that mix multiple Dirichlet prior parameters, called Multi-Dirichlet priors (MD) in this paper, are gaining popularity. Inferring mixing weights and parameters of mixed prior distributions seems tricky, as sums over Dirichlet parameters complicate the joint distribution of model parameters. This paper s…
Flow on weighted graphs sharpens Bakry-Émery curvature.
Adaptive weighting schemes enhance time-series data augmentation for financial and UCR datasets.
In this paper we focus on the subdiffusive Black Scholes model. The main part of our work consists of the finite difference method as a numerical approach to the option pricing in the considered model. We derive the governing fractional differential equation and the related weighted numerical scheme being a generalizat…
New initialization schemes preserve fractional moments of weights in deep networks, improving training and test performance.
In this work, a non-gradient descent learning (NGDL) scheme was proposed for deep feedforward neural networks (DNN). It is known that an autoencoder can be used as the building blocks of the multi-layer perceptron (MLP) DNN, the MLP is taken as an example to illustrate the proposed scheme of pseudoinverse learning algo…
While deep neural networks are a highly successful model class, their large memory footprint puts considerable strain on energy consumption, communication bandwidth, and storage requirements. Consequently, model size reduction has become an utmost goal in deep learning. A typical approach is to train a set of determini…
We introduce a principled method for the signed clustering problem, where the goal is to partition a graph whose edge weights take both positive and negative values, such that edges within the same cluster are mostly positive, while edges spanning across clusters are mostly negative. Our method relies on a graph-based …
Manipulating data, such as weighting data examples or augmenting with new instances, has been increasingly used to improve model training. Previous work has studied various rule- or learning-based approaches designed for specific types of data manipulation. In this work, we propose a new method that supports learning d…
The Tsetlin Machine (TM) is an interpretable mechanism for pattern recognition that constructs conjunctive clauses from data. The clauses capture frequent patterns with high discriminating power, providing increasing expression power with each additional clause. However, the resulting accuracy gain comes at the cost of…
New method improves neural network performance by focusing on steep function regions.
AWARE improves graph prediction by aggregating walks with attention schemes.
A new weighted FDA method improves face recognition accuracy.
This paper establishes rates of universal approximation for the shallow neural tangent kernel (NTK): network weights are only allowed microscopic changes from random initialization, which entails that activations are mostly unchanged, and the network is nearly equivalent to its linearization. Concretely, the paper has …
Improves Lasso's stability in correlated predictor settings.
High order splitting schemes with complex timesteps are applied to Kolmogorov backward equations stemming from stochastic differential equations in Stratonovich form. In the setting of weighted spaces, the necessary analyticity of the split semigroups can be easily proved. A numerical example from interest rate theory,…
The use of automatic methods, often referred to as Neural Architecture Search (NAS), in designing neural network architectures has recently drawn considerable attention. In this work, we present an efficient NAS approach, named HM- NAS, that generalizes existing weight sharing based NAS approaches. Existing weight shar…
Proposes a non-convex optimization method for a parsimonious weighted naive Bayes classifier.
The MBO scheme for data clustering is analyzed in the large data limit, proving convergence to optimal partition problems.
In artificial neural networks, learning from data is a computationally demanding task in which a large number of connection weights are iteratively tuned through stochastic-gradient-based heuristic processes over a cost-function. It is not well understood how learning occurs in these systems, in particular how they avo…
New bounds for PDA using partial optimal transport improve domain alignment.
Differentially private weighted sampling improves privacy while maintaining utility.
Optimizes pension mix of PAYGO, EET, and individual savings.
Deep learning relies on good initialization schemes and hyperparameter choices prior to training a neural network. Random weight initializations induce random network ensembles, which give rise to the trainability, training speed, and sometimes also generalization ability of an instance. In addition, such ensembles pro…
We propose an iterative scheme for feature-based positioning using a new weighted dissimilarity measure with the goal of reducing the impact of large errors among the measured or modeled features. The weights are computed from the location-dependent standard deviations of the features and stored as part of the referenc…
In binary classification framework, we are interested in making cost sensitive label predictions in the presence of uniform/symmetric label noise. We first observe that - Bayes classifiers are not (uniform) noise robust in cost sensitive setting. To circumvent this impossibility result, we present two schemes; un…
In this note, we present a new averaging technique for the projected stochastic subgradient method. By using a weighted average with a weight of t+1 for each iterate w_t at iteration t, we obtain the convergence rate of O(1/t) with both an easy proof and an easy implementation. The new scheme is compared empirically to…
New method improves tensor completion by selectively preserving important elements.