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

Trend · papers per month

2.6%5.2%7.8%10.4% · Jun 202019922001200920172026
48 results for knowledge aggregation

Model infers functions for attributes using multi-aggregate datasets with knowledge transfer.

problem Modeling aggregate data with varying granularities and spatial supports.
method Multi-output Gaussian process (MoGP) with linear mixing of independent latent GPs, aggregation process, and prior distribution of mixing weights.
result Proposed model outperforms in refining coarse-grained aggregate data.

OKDDip uses diverse peers to improve online knowledge distillation.

problem Early saturation in group-based distillation.
method Two-level distillation with multiple auxiliary peers and a group leader, using attention-based aggregation weights.
result OKDDip consistently gives better performance than state-of-the-art approaches.

MULTIPOLAR aggregates diverse source policies for efficient transfer RL.

problem Efficiently transfer knowledge between different environmental dynamics.
method Adaptive action aggregation and residual prediction network.
result Demonstrated effectiveness across diverse simulated environments.

The paper uses tensor decompositions to improve neural network models for tree data.

problem Encoding structural knowledge from tree-structured data efficiently.
method Introduces new aggregation functions using Canonical and Tensor-Train decompositions.
result Proposed models outperform traditional methods on tree classification tasks.

The paper examines the feasibility of managing aggregate cyber-risk in IoT environments.

problem Determining sustainable conditions for providing aggregate cyber-risk coverage.
method Developed a rigorous general theory and validated it with real data.
result Conditions for sustainable aggregate cyber-risk management under heavy-tailed distributions.

Paper proves impossible for large language models to control hallucinations without sacrificing other properties.

problem Achieving truthful knowledge representation, semantic information conservation, and knowledge-constrained optimality simultaneously in large language models.
method Modeling inference as an auction of ideas, using mechanism design, proper scoring rules, and transformer architecture analysis.
result No LLM can simultaneously achieve all four essential properties without violating at least one.

The policy objective of safeguarding financial stability has stimulated a wave of research on systemic risk analytics, yet it still faces challenges in measurability. This paper models systemic risk by tapping into expert knowledge of financial supervisors. We decompose systemic risk into a number of interconnected seg…

2014-12-17abs ↗pdf ↗

Optimized Q-learning reduces regret in state-aggregated MDPs.

problem Reducing regret in reinforcement learning with state aggregation.
method Optimistic Q-learning applied to fixed-horizon episodic MDPs with aggregated states.
result Regret bound of ildeO(H5MK+εHK) ilde{\mathcal{O}}(\sqrt{H^5 M K} + εHK), independent of states and actions.

In order to improve forecasts, a decisionmaker often combines probabilities given by various sources, such as human experts and machine learning classifiers. When few training data are available, aggregation can be improved by incorporating prior knowledge about the event being forecasted and about salient properties o…

2012-07-11abs ↗pdf ↗

This paper introduces glocal explanations for expected goal models in soccer.

problem Limited interpretability of expected goal models trained with black-box methods.
method Proposes glocal explanations using aggregated SHAP values and partial dependence profiles.
result Extracts knowledge from expected goal models for teams and players, enhancing performance analysis.

State aggregation is a popular model reduction method rooted in optimal control. It reduces the complexity of engineering systems by mapping the system's states into a small number of meta-states. The choice of aggregation map often depends on the data analysts' knowledge and is largely ad hoc. In this paper, we propos…

2018-11-06abs ↗pdf ↗

This study examines yield aggregators in DeFi, summarizing strategies and analyzing performance.

problem Understanding and optimizing yield farming strategies in DeFi.
method Summarizes yield farming protocols and tokens, analyzes performance through simulations and empirical data.
result Plausible connection between data anomalies and historical events in yield aggregators.

Paper proposes a new method to aggregate multiple sources with different label distributions.

problem Aggregating from multiple target-shifted sources with different label distributions.
method Unified framework to select relevant sources for domain adaptation with limited label, unsupervised, and label partial unsupervised scenarios.
result Empirical results significantly outperform baselines.

We prove a lower bound for feature dimension in linear MDPs and propose a novel dynamics aggregation framework.

problem The limitation of feature dimension in linear MDPs and the need for efficient hierarchical reinforcement learning.
method We propose a novel dynamics aggregation framework based on structural dynamics and design a provably efficient hierarchical reinforcement learning algorithm.
result Our algorithm achieves a regret of ildeO(dψ3/2H3/2NT) ilde{O} ( d_ψ^{3/2} H^{3/2}\sqrt{ N T} ) and meets the condition dψ3Nd3d_ψ^3 N \ll d^{3} in most real-world environments.

Early-stopped aggregation improves computational efficiency in adaptive statistical inference.

problem Computational inefficiency in model selection and aggregation for adaptive inference.
method Early-stopped aggregation (ESA) framework: compute only a few simpler models using early-stopping criteria.
result ESA achieves optimal adaptive contraction rates in variational Bayes and frequentist settings.

Proposes a novel MTL approach based on bias-variance analysis.

problem Improving multi-task learning performance through shared knowledge.
method Two-phase iterative aggregation of targets and features using bias-variance analysis.
result Validation on synthetic and real-world datasets demonstrates the effectiveness of the proposed method.

PhyDNN uses physics knowledge to improve drag force prediction models.

problem Complex physical processes in fluid dynamics are hard to model accurately.
method Physics-guided structural priors and aggregate supervision for deep learning.
result PhyDNN achieves a significant 8.46% improvement in drag force prediction.

The paper introduces a tensor-based approach to improve neural models' aggregation of structural context.

problem Sub-optimal use of simple aggregation functions in neural models for structured data.
method Tensor-based formulation and Tucker tensor decomposition to control parameter space size.
result Effective regulation of trade-off between expressivity, computational complexity, and generalisation.

We analyze a fast incremental aggregated gradient method for optimizing nonconvex problems of the form minxifi(x)\min_x \sum_i f_i(x). Specifically, we analyze the SAGA algorithm within an Incremental First-order Oracle framework, and show that it converges to a stationary point provably faster than both gradient descent and s…

2016-03-19abs ↗pdf ↗

New method ranks sectors and countries using local and aggregate I-O data.

problem Ranking sectors and countries in global value chains using incomplete I-O tables.
method Rank-11 approximation to I-O tables using local and aggregate information.
result Consistently good performance in reconstructing rankings of upstreamness and downstreamness.

This paper improves prediction accuracy for multi-input classification tasks using p-value aggregation.

problem Generating accurate predictive sets with guaranteed coverage for multi-input classification tasks.
method Integrates p-values from each observation to reduce the size of the predicted label set while maintaining class-conditional coverage.
result The method reduces the size of the predicted label set while preserving the required coverage guarantee.

The paper calculates VaR and CTE for extreme and aggregate risks using FGM copula.

problem Estimating risk measures for extreme and aggregate risks of dependent and independent markets.
method Used FGM copula to model dependence, exponential and pareto distributions for marginal risks.
result Effect of dependency on VaR and CTE of extreme and aggregate risks analyzed.

Since time immemorial, people have been looking for ways to organize scientific knowledge into some systems to facilitate search and discovery of new ideas. The problem was partially solved in the pre-Internet era using library classifications, but nowadays it is nearly impossible to classify all scientific and popular…

2018-11-15abs ↗pdf ↗

This paper improves route choice models by incorporating contextual factors.

problem Existing route choice models lack consideration of dynamic contextual conditions.
method Knowledge distillation from Stated Choice Experiments in Immersive Virtual Environment.
result High-fidelity route choice models with increased predictive power.

Simple aggregation of multiple methods defends against adversarial attacks on neural networks.

problem Manipulation of machine learning models to hide discriminating features.
method Aggregation of multiple explanation methods to make the model robust against adversarial attacks.
result The model remains robust even when the attacker has knowledge of the model weights and explanation methods.

Online news recommender systems aim to address the information explosion of news and make personalized recommendation for users. In general, news language is highly condensed, full of knowledge entities and common sense. However, existing methods are unaware of such external knowledge and cannot fully discover latent k…

2018-01-25abs ↗pdf ↗

A new framework for deep learning from multiple experts tackles long-tailed data issues.

problem Training deep networks on imbalanced data distributions.
method Learning From Multiple Experts (LFME) framework, involving self-paced expert selection and curriculum instance selection.
result LFME achieves superior performance compared to state-of-the-art methods.

GCNs improve regression tasks by aggregating neighbor signals.

problem GCNs' statistical properties in regression tasks are poorly understood.
method Examined two GCN convolutions and their impact on learning error.
result GCNs have a bias-variance trade-off that depends on neighborhood size and topology.

Proposes OpenKI for better web-scale knowledge extraction and alignment.

problem Combining OpenIE and KB for web-scale knowledge extraction and alignment.
method Instance-level inference using neighborhood information from KB and OpenIE extractions, with attention mechanisms.
result Significantly improves performance on OpenIE extractions and semi-structured data.

Federated Learning speeds up speech recognition training by 7x and reduces error rate by 6%.

problem Training acoustic models for speech recognition tasks in a federated manner.
method Hierarchical optimization and dynamic gradient aggregation methods.
result Significant improvement in training convergence speed and model performance.

Paper tackles sparse, unstructured data tensors by optimizing adaptive aggregation granularity.

problem Sparse, unstructured data tensors are hard to analyze.
method Introduces IceBreaker, a greedy algorithm that optimizes adaptive tensor aggregation.
result IceBreaker constructs tensors with high structure quality from various datasets.

HGKT transfers knowledge from seen to unseen classes in GZSL without prior unseen class info.

problem Learning to classify unseen classes in GZSL.
method Structured heterogeneous graph with graph neural network for knowledge transfer.
result Achieves state-of-the-art results on public benchmark datasets.

We consider the multi-label ranking approach to multi-label learning. Boosting is a natural method for multi-label ranking as it aggregates weak predictions through majority votes, which can be directly used as scores to produce a ranking of the labels. We design online boosting algorithms with provable loss bounds for…

2017-10-23abs ↗pdf ↗