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.

169,181 papers · 148 categories

Trend · papers per month

3.4%6.7%10.1%13.4% · Jun 202019922001200920182026
48 results for common knowledge

ZSL-KG learns class representations from common sense knowledge graphs.

problem Predicting classes without labeled examples using semantic class representations.
method TrGCN, a novel transformer graph convolutional network, embeds nodes from common sense knowledge graphs in a vector space.
result ZSL-KG improves over existing methods on five out of six zero-shot benchmark datasets.

Bayesian optimization improves performance with common random numbers.

problem Optimizing expensive stochastic functions with common random numbers.
method Proposes a novel Gaussian process model and Knowledge Gradient for Common Random Numbers.
result Significant performance improvements with moderate computational cost.

Improved GCNNs tackle noisy knowledge graphs for better link prediction.

problem Link prediction on noisy biomedical knowledge graphs.
method Regularized attention mechanism for GCNNs, interpretable visualization methods.
result Improved performance on noisy datasets, automated denoising potential.

Paper learns a versatile model from diverse networks without annotations.

problem Combining knowledge from different specialized networks without access to their training data.
method Transforms features of diverse networks into a common space and forces a student model to mimic them.
result The student model outperforms individual teacher models on various benchmarks.

A new personality-based recommender system tackles data sparsity without feedback.

problem Data sparsity without common feedback among users.
method Implicitly identifying users' personality type and incorporating it with personal interests and knowledge level.
result The model's effectiveness, especially in data sparsity situations, demonstrated on a real-world dataset.

Framework evaluates the impact of prior knowledge in deep learning models.

problem Mitigating data-driven model shortcomings like data dependence and generalization ability.
method Model-agnostic framework inspired by interpretable machine learning, assessing data volume and estimation range effects.
result Complex relationship between data and knowledge, including dependence, synergistic, and substitution effects.

This paper improves speech recognition by distilling knowledge from acoustic models.

problem Improving speech recognition accuracy using ensemble models.
method Proposes multi-teacher distillation strategies for joint CTC-attention end-to-end ASR systems, integrating error rate metric for optimization.
result Reports state-of-the-art error rates on various datasets and languages.

Induction of common sense knowledge about prototypical sequences of events has recently received much attention. Instead of inducing this knowledge in the form of graphs, as in much of the previous work, in our method, distributed representations of event realizations are computed based on distributed representations o…

2013-12-18abs ↗pdf ↗

Models learn spatial templates from implicit language, predicting spatial arrangements with high accuracy.

problem Predicting spatial arrangements from implicit spatial language.
method Simple neural-based models leveraging annotated images and structured text.
result Models can predict spatial arrangements from implicit spatial language with high accuracy, even for unseen objects.

New method predicts target genres from source genres, unifying music tag systems.

problem Automatic genre inference fails to handle music genre diversity and subjectivity.
method Knowledge-based, statistical, and hybrid translation models.
result Hybrid translation model is most effective for multilabel classification.

The paper provides fast, sample-efficient algorithms for learning common features in multi-task linear regression.

problem Learning transferable features from multiple related tasks.
method Provably fast, sample-efficient algorithms for multi-task linear regression.
result Theoretical guarantees on sample complexity for learning common features.

Proposes a method to identify causal relationships using background knowledge.

problem Identifying causal relationships in the presence of background knowledge.
method Learning local structure using all types of causal background knowledge (direct, non-ancestral, ancestral). Criteria for identifying causal relationships based on local structure.
result Effective and efficient method for local structure learning and causal relationship identification.

New approach combines multi-view learning for improved convergence in knowledge transfer.

problem Improving convergence in knowledge transfer settings like learning with privileged information and distillation.
method Adopting a multi-view approach under reasonable assumptions about hypothesis spaces, encouraging agreement between teacher and student.
result Improved convergence rate achieved with regularized empirical risk minimization.

MetaR learns few-shot link prediction in KGs by transferring relation-specific meta info.

problem Few-shot link prediction in KGs with limited associative triples.
method MetaR framework focusing on transferring relation-specific meta information.
result MetaR achieves state-of-the-art results on few-shot link prediction benchmarks.

HAKE embeds entities in polar coordinates to model semantic hierarchies in knowledge graphs.

problem Lack of modeling semantic hierarchies in knowledge graph embeddings.
method HAKE embeds entities in a polar coordinate system, where the radial coordinate represents hierarchy levels and the angular coordinate distinguishes entities at the same level.
result HAKE significantly outperforms existing methods on link prediction tasks in knowledge graphs.

The incorporation of prior knowledge into learning is essential in achieving good performance based on small noisy samples. Such knowledge is often incorporated through the availability of related data arising from domains and tasks similar to the one of current interest. Ideally one would like to allow both the data f…

2017-05-30abs ↗pdf ↗

A novel fact-checking method using debate dynamics on knowledge graphs.

problem Fact-checking on knowledge graphs with user comprehension and interactive reasoning.
method Reinforcement learning agents debate on paths in the graph to classify facts as true or false.
result Interactive reasoning and user understanding of AI decisions on knowledge graphs.

DKN uses knowledge graphs to improve news recommendation.

problem Limited personalized news recommendations due to lack of external knowledge.
method Integrates knowledge graph representation into news recommendation using a deep knowledge-aware network (DKN).
result DKN achieves substantial gains over state-of-the-art models in click-through rate prediction.

This paper introduces a new reward shaping method for average-reward reinforcement learning.

problem Speeding up convergence to an optimal policy in average-reward reinforcement learning tasks.
method Developed a temporal logic-based approach to automatically generate reward shaping functions.
result The optimal policy can be recovered using the proposed reward shaping framework.

Role-wise data augmentation improves knowledge distillation effectiveness.

problem Existing knowledge distillation methods fail to utilize the full potential of teacher-student data interaction.
method Design and implement data augmentation agents with distinct roles for teacher and student.
result Specially tailored data points enhance the demonstration of teacher's knowledge to the student.

Unified framework for multi-source data analysis improves network structure identification.

problem High dimensionality and heterogeneity in large-scale network data.
method msLBM framework combining multiple data sources for simultaneous grouping and connectivity analysis.
result Statistically optimal rates achieved for consensus knowledge graph learning.

A new method for optimizing black-box problems with constraints.

problem Optimizing black-box systems with multiple performance criteria and constraints.
method Developed a novel constrained Bayesian optimization approach based on the knowledge gradient method.
result A new acquisition function that balances optimality and feasibility.

Developed LQ MFG theory with common noise, proving existence and uniqueness.

problem Linear-quadratic mean field games with common noise.
method Coupled forward-backward stochastic evolution equations (FBSEEs) in Hilbert spaces.
result Existence and uniqueness of solutions for small and arbitrary finite time horizons.

Spatial information is not always necessary for spatio-temporal models.

problem The necessity of including spatial information in spatio-temporal models.
method Comparison of spatial agnostic neural networks with state-of-the-art models on ten datasets.
result Spatial information is not always needed in most spatio-temporal models.

New method models multi-view noise as Mixture of Gaussians for robust MSL.

problem Robust multi-view subspace learning with complex noise.
method Model multi-view noise as Mixture of Gaussians, regularize across views.
result Method outperforms existing models in robustness and interpretability.

Enhancing spectral embedding for low-dimensional embeddings in rare disease cohorts

problem Representing clinical concepts and patients in electronic health records
method Spectral-based unsupervised learning with flexible knowledge transfer
result Outperforms competing approaches in challenging scenarios

Research examines how Islamic banking principles spread among managers and scholars.

problem Diffusion of Islamic banking principles among managers and scholars.
method Literature review focusing on knowledge diffusion and Islamic banking governance principles.
result Emergence of common Islamic banking governance principles from diverse knowledge streams.

DASH simplifies neural networks for gene regulatory dynamics using domain knowledge.

problem Pruning neural networks for gene regulatory dynamics lacks biologically meaningful structure learning.
method DASH uses domain-specific structural information to guide network pruning, leading to sparser, better interpretable models.
result DASH outperforms general pruning methods in gene regulatory network inference, yielding deeper insights.

MetaNOR learns common nonlocal kernels for efficient metamaterial modeling.

problem Efficiently modeling wave propagation in new metamaterials.
method Meta-learns a common nonlocal kernel from existing tasks and transfers this knowledge to new tasks with minimal data.
result Substantial improvements in sampling efficiency for new metamaterials.

SRL+CS improves deep RL by incorporating common sense, achieving near perfect zero-shot transfer.

problem Lack of transfer learning, abstraction, and interpretability in deep RL.
method Proposes SRL+CS, a novel extension of DSRL that balances generalization and specialization using principles of common sense.
result SRL+CS learns faster and achieves higher accuracy, including near perfect zero-shot transfer in a random environment.