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

Trend · papers per month

4048081,2111,615 · Jun 202019922001200920172026
48 results for model parameter similarity

CoLoRA leverages task similarity to boost fine-tuning efficiency.

problem Efficiently fine-tuning large foundation models with scarce labeled data.
method CoLoRA trains a shared adapter for task similarity and personalized adapters for user-specific tasks.
result CoLoRA significantly boosts fine-tuning performance when tasks are similar.

Study properties of self-similar continua with finite intersection property.

problem Characterize self-similar continua with finite intersection property.
method Prove intersection graph criterion, finite order theorem, and parameter matching theorem.
result All Jordan arcs starting from a intersection point in such continuum on a plane should have the same slope parameter at that point.

Recommender systems have recently attracted many researchers in the deep learning community. The state-of-the-art deep neural network models used in recommender systems are typically multilayer perceptron and deep Autoencoder (DAE), among which DAE usually shows better performance due to its superior capability to reco…

2018-12-25abs ↗pdf ↗

Framework for multi-task learning with semiparametric models and nuisance parameters.

problem Improving parameter estimation from diverse, heterogeneous datasets.
method Late fusion multi-task learning framework with two-step process: individual task learning followed by adaptive aggregation.
result The method achieves faster convergence rates compared to individual task learning when tasks share similar parametric components.

We propose weighted inner product similarity\textit{weighted inner product similarity} (WIPS) for neural network-based graph embedding. In addition to the parameters of neural networks, we optimize the weights of the inner product by allowing positive and negative values. Despite its simplicity, WIPS can approximate arbitrary general similarities in…

2019-02-27abs ↗pdf ↗

Inducing sparseness while training neural networks has been shown to yield models with a lower memory footprint but similar effectiveness to dense models. However, sparseness is typically induced starting from a dense model, and thus this advantage does not hold during training. We propose techniques to enforce sparsen…

2018-08-27abs ↗pdf ↗

Improved similarity search in embeddings using InfoNCE loss.

problem Improving similarity search in embedding models trained by contrastive learning.
method Introduced a new continuity bound for InfoNCE loss via Gâteaux differentiation, preserving the averaging effect of negative samples.
result Demonstrated that the averaging effect of kk negative samples in InfoNCE loss carries over to stabilisation of generalisation error as kk grows.

Meta-learning framework uses task similarity through nonparametric kernel regression.

problem Limited tasks and outliers/dissimilar tasks hinder meta-learning performance.
method Nonparametric kernel regression to quantify and use task similarity.
result Meta-learning algorithm outperforms existing methods in task-limited settings.

Novel channel pruning method accelerates deep CNNs by removing redundant, similar features.

problem Limitations of existing magnitude-based pruning algorithms in similar magnitude cases.
method Hierarchical clustering of channels based on probabilistic similarity metrics, without sparsity training.
result 30% reduction in FLOPs for pruned ResNet-50 on ImageNet, outperforming baseline.

In this paper, we study two classes of planar self-similar fractals TεT_\varepsilon with a shifting parameter ε\varepsilon. The first one is a class of self-similar tiles by shifting xx-coordinates of some digits. We give a detailed discussion on the disk-likeness ({\it i.e., the property of being a topological disk}…

2017-01-05abs ↗pdf ↗

Single-layer GCN model improves recommendation performance with less complexity.

problem Severe computational burden and excessive model parameters in existing GCN models.
method Proposes a single-layer GCN architecture with a simplified aggregation step using DA similarity.
result Significantly outperforms existing GCN models and achieves up to a few orders of magnitude speedup.

SDP approach recovers communities in multilayer hypergraphs from aggregated similarity matrices.

problem Community recovery in multilayer hypergraphs using aggregated similarity matrices.
method Semidefinite programming (SDP) approach.
result Information-theoretic conditions for exact recovery in both assortative and disassortative cases.

Rapid overlay of chemical structures (ROCS) is a standard tool for the calculation of 3D shape and chemical ("color") similarity. ROCS uses unweighted sums to combine many aspects of similarity, yielding parameter-free models for virtual screening. In this report, we decompose the ROCS color force field into "color com…

2016-06-06abs ↗pdf ↗

CAM-GAN improves GANs for continual learning with efficient feature map transformations.

problem Efficient continual learning for GANs with reduced parameter growth.
method Designing and leveraging parameter-efficient feature map transformations, including global and task-specific parameters, residual bias, and Fisher information matrix.
result Significantly improved model performance and high-quality samples with fewer parameters.

The paper develops a decision support system for hierarchical text classification of conference proceedings.

problem Classifying documents with a fixed hierarchical structure of topics.
method Developed a weighted hierarchical similarity function to calculate topic relevance, using entropy of words to estimate weights.
result The weighted hierarchical similarity function improves ranking accuracy compared to other methods.

New algorithms improve multi-task bandit performance by transferring reward samples.

problem Sequential multi-task bandit problems with adjacent similar tasks.
method Two UCB-based algorithms that transfer reward samples between tasks.
result Transfer of reward samples reduces overall regret compared to no transfer.

STANCE learns string similarity using optimal transport alignment.

problem Computing similarity between strings for record linkage and entity resolution.
method Character encoding, optimal transport alignment, convolutional neural network scoring.
result STANCE outperforms state-of-the-art models on alias detection datasets.

Meta-analysis improves interpretation and efficiency across similar but non-identical datasets.

problem Meta-analysis of heterogeneous data in high dimensions.
method Integrative sparse regression with a global parameter for adaptability and anonymity.
result Superior identification of global parameter for high-dimensional linear models.

We propose a novel model for generating graphs similar to a given example graph. Unlike standard approaches that compute features of graphs in Euclidean space, our approach obtains features on a surface of a hypersphere. We then utilize a von Mises-Fisher distribution, an exponential family distribution on the surface …

2011-05-15abs ↗pdf ↗

Deep networks infer parameters for chaotic dynamics in climate models.

problem Uncertainty in climate sensitivity due to coarse model resolution.
method Three deep network algorithms (fully-connected, 1D, 2D convolutional) trained on Lorenz-96 model.
result Convolutional networks outperform fully-connected and 1D networks in parameter recovery.

The paper uses pattern similarity-based methods for mid-term electricity demand forecasting.

problem Forecasting monthly electricity demand with seasonal patterns.
method Pattern similarity-based machine learning models (nearest neighbor, fuzzy neighborhood, kernel regression, GRNN).
result The proposed models outperform classical and state-of-the-art models in accuracy and simplicity.

Study forecasts monthly electricity demand using pattern similarity-based methods.

problem Forecasting monthly electricity demand accurately.
method Pattern similarity-based forecasting methods (PSFMs) including k-NN, fuzzy, kernel regression, and GRNN.
result Ensemble models outperform individual PSFMs in forecasting accuracy.

C2G-Net improves image classification of similar objects like cells.

problem Classifying images with many similar objects efficiently and interpretably.
method Combines image compression and a CNN with reduced parameters.
result C2G-Net achieves similar accuracy to conventional CNNs but with reduced training time and improved interpretability.

The paper models and predicts co-occurrence counts using Gamma regression.

problem Predicting relevance between items or users from high-dimensional sparse co-occurrence count data.
method Shared parameter alternating zero-inflated Gamma regression models (SA-ZIG) with Fisher scoring and learning rate adjustment.
result SA-ZIG with learning rate adjustment performs satisfactorily in predicting relevance.

Study improves GMM learning performance through multi-task and transfer learning.

problem Improving GMM learning performance through similar task structures.
method Proposes a multi-task GMM learning procedure based on EM algorithm, robust to outliers.
result Achieves minimax optimal rate of convergence for parameter estimation and mis-clustering.

Parameter inference for stochastic differential equations is challenging due to the presence of a latent diffusion process. Working with an Euler-Maruyama discretisation for the diffusion, we use variational inference to jointly learn the parameters and the diffusion paths. We use a standard mean-field variational appr…

2018-02-09abs ↗pdf ↗

Cross-validation (CV) is often used to select the regularization parameter in high dimensional problems. However, when applied to the sparse modeling method Lasso, CV leads to models that are unstable in high-dimensions, and consequently not suited for reliable interpretation. In this paper, we propose a model-free cri…

2013-03-13abs ↗pdf ↗

Deep neural networks estimate long memory parameters efficiently.

problem Estimating long memory parameters in stochastic processes.
method Scale-invariant 1D Convolutional Neural Networks (CNNs) and Long Short-Term Memory (LSTM) models trained with synthetic data.
result Neural models outperform conventional methods in precision, speed, consistency, and robustness.

Modeling buildings' heat dynamics is a complex process which depends on various factors including weather, building thermal capacity, insulation preservation, and residents' behavior. Gray-box models offer a causal inference of those dynamics expressed in few parameters specific to built environments. These parameters …

2019-01-09abs ↗pdf ↗