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

Trend · papers per month

164328492656 · Jun 202019922001200920172026
48 results for task identity

Structural identity is a concept of symmetry in which network nodes are identified according to the network structure and their relationship to other nodes. Structural identity has been studied in theory and practice over the past decades, but only recently has it been addressed with representational learning technique…

2017-04-11abs ↗pdf ↗

RLINK uses deep reinforcement learning to improve user identity linkage across social networks.

problem Recognizing the same user across different social networks.
method Converts user identity linkage into a sequence decision problem and uses deep reinforcement learning to optimize the linkage strategy.
result Achieves better performance than state-of-the-art methods in experiments on various datasets.

Three scenarios for continual learning tasks are described and compared.

problem Difficulty in comparing continual learning methods due to different evaluation protocols.
method Three continual learning scenarios based on task identity and inference requirements.
result Different scenarios have varying difficulty and require different approaches.

Most existing word embedding approaches do not distinguish the same words in different contexts, therefore ignoring their contextual meanings. As a result, the learned embeddings of these words are usually a mixture of multiple meanings. In this paper, we acknowledge multiple identities of the same word in different co…

2016-11-29abs ↗pdf ↗

Bayesian weight priors improve neural network learning of identity relations.

problem Neural networks struggle to learn abstract and systematic relations, especially identity relations.
method Extended RBP approach using Bayesian weight priors as a regularization term.
result Bayesian weight priors lead to perfect generalization for identity relations and do not hinder standard neural network learning.

Augments GNNs with diversification to preserve node identity.

problem Current GNNs filter node information, potentially losing node identity.
method Integrates diversification operators with aggregation to enrich node representations.
result Significant performance boost on 9 node classification tasks.

New ITID assumption improves generalization in practical tasks.

problem Generalization theories fail to interpret many generalization phenomena and guide practical learning tasks due to the IID assumption.
method Proposes ITID assumption to consider task properties, derives a new generalization bound, and introduces an invariance enhancement algorithm.
result Demonstrates the effectiveness of the new generalization theory in improving practical generalization performance.

The paper provides guarantees for learning nonlinear representations from multiple non-identically distributed data sources.

problem Learning from non-identically distributed and dependent data.
method Established statistical guarantees for learning general nonlinear representations from multiple data sources.
result The excess risk of the estimated function decays as a function of the sample complexity and task diversity.

OCEAN infers online task identities from context variables.

problem Online task inference for compositional tasks with context adaptation.
method Variational inference framework OCEAN models global and local context variables in a joint latent space.
result OCEAN provides more effective task inference with sequential context adaptation.

Novel framework for data sharing and coordinated exploration in concurrent RL with non-identical environments.

problem Learning more data-efficient and better policies in concurrent RL with non-identical environments.
method Proposes a novel algorithmic framework that leverages causal inference via ANM-MM to extract model parameters and a new data sharing scheme based on similarity measures.
result Demonstrates superior learning speeds on various tasks and effectiveness of diverse action selection.

New research shows non-bottlenecked autoencoders can outperform bottlenecked ones for anomaly detection.

problem The necessity of a bottleneck in autoencoders for anomaly detection.
method Investigated two ways to remove bottlenecks: overparameterising the latent layer and introducing skip connections. Carried out extensive experiments on various AE types and datasets.
result Non-bottlenecked autoencoders can outperform bottlenecked ones, improving anomaly detection performance.

Anti-transfer learning prevents misleading representations for speech tasks.

problem Misleading representations learned from orthogonal tasks in speech processing.
method Penalizes similarity between activations of a network and another trained on an orthogonal task.
result Improves classification accuracy and invariance to the orthogonal task.

New sampling and identity-testing methods for mixtures of distributions that don't satisfy approximate tensorization of entropy.

problem Sampling and identity-testing for mixtures of distributions that don't satisfy approximate tensorization of entropy.
method Fast mixing of Glauber dynamics and efficient identity-testers in the coordinate-conditional sampling access model.
result Efficient identity-testers for mixtures of ATE distributions in the coordinate-conditional sampling access model.

Neural networks struggle with identity relations; DR units improve generalization.

problem Neural networks fail to generalize identity relations.
method Exploring various factors in neural network architecture and learning process, including number of hidden layers, activation function, and data representation.
result DR units improve generalization, leading to almost perfect test accuracy in mid fusion setting.

VRL-SGD reduces communication complexity in non-identical data settings.

problem Training machine learning models with non-identical data distribution.
method VRL-SGD, which eliminates gradient variance dependency and achieves linear speedup with lower communication complexity.
result VRL-SGD reduces communication complexity from $O(T^{ rac{3}{4}} N^{ rac{3}{4}})$ to $O(T^{ rac{1}{2}} N^{ rac{3}{2}})$.

In this paper we study speaker linking (a.k.a.\ partitioning) given constraints of the distribution of speaker identities over speech recordings. Specifically, we show that the intractable partitioning problem becomes tractable when the constraints pre-partition the data in smaller cliques with non-overlapping speakers…

2014-03-26abs ↗pdf ↗

This paper discovers new identities linking geodesic and orthogeodesic lengths on hyperbolic surfaces.

problem Understanding relationships between geodesic and orthogeodesic lengths on hyperbolic surfaces.
method Investigates a broad family of identities involving lengths of all closed geodesics and orthogeodesics.
result Introduces new identities that include lengths of all closed geodesics, contrasting with previous identities.

New method estimates animal density using acoustic data, accounting for unknown call identities.

problem Estimating animal density or call density from acoustic data with unknown call identities.
method Monte Carlo Expectation-Maximization (MCEM) method to resolve unknown call identities.
result Estimates are within 15% of expert-constructed estimates and incorporate uncertainty about call identities.

Gradient-based meta-learning methods leverage gradient descent to learn the commonalities among various tasks. While previous such methods have been successful in meta-learning tasks, they resort to simple gradient descent during meta-testing. Our primary contribution is the {\em MT-net}, which enables the meta-learner…

2018-01-17abs ↗pdf ↗

Proposes using entity embedding vectors to improve Gaussian Process models for knowledge transfer across cell lines.

problem Lack of reuse of experimental data for predicting novel processes.
method Hybrid Gaussian Process models with entity embedding vectors to represent product identity.
result Improved performance in predicting novel processes compared to traditional methods.

Quandle homology was defined from rack homology as the quotient by a subcomplex corresponding to the idempotency, for invariance under the type I Reidemeister move. Similar subcomplexes have been considered for various identities of racks and moves on diagrams. We observe common aspects of these identities and subcompl…

2016-02-27abs ↗pdf ↗

A new optimizer, Grad-Avg, converges faster than SGD and improves classification task performance.

problem Optimizing error functions in regression and classification tasks.
method Grad-Avg optimizer based on gradient averaging, with mathematical convergence proof and parameter scaling for classification.
result Grad-Avg converges faster than other optimizers for classification tasks on benchmark datasets.

The paper derives curvature identities for 5D and 6D Einstein manifolds.

problem Deriving curvature identities for specific dimensions of Einstein manifolds.
method Using Patterson's curvature identities and the Chern-Gauss-Bonnet Theorem, the paper provides explicit formulae for 5D and 6D Einstein manifolds.
result The curvature identities for 5D and 6D Einstein manifolds are confirmed to be consistent with previous work.