The paper introduces GAER to assess market feasibility under geopolitical and institutional constraints.
problem Feasibility of adaptive market efficiency under heterogeneous institutional and geopolitical conditions.
method Structural framework integrating adaptive market theory, institutional economics, and political economy.
result GAER as a diagnostic indicator for portfolio construction feasibility.
Unified view of context-adaptive inference across statistics, meta-learning, and foundation models.
problem Adapting predictive systems to specific situations.
method Unified framework for context-adaptive inference, bridging statistics, meta-learning, and foundation models.
result Explicit and implicit approaches are mathematically equivalent under certain conditions.
We propose an original particle-based implementation of the Loopy Belief Propagation (LPB) algorithm for pairwise Markov Random Fields (MRF) on a continuous state space. The algorithm constructs adaptively efficient proposal distributions approximating the local beliefs at each note of the MRF. This is achieved by cons…
FLoE adapts LLMs by selectively deploying LoRA adapters based on layer importance and task requirements.
problem Uniform LoRA deployment across all layers leads to inefficient and redundant parameter allocation.
method FLoE uses Fisher information to dynamically identify task-critical layers and optimizes LoRA ranks.
result FLoE achieves significant efficiency-accuracy trade-offs, especially in resource-constrained environments.
Optimal transport between Gaussian Mixture Models improves domain adaptation efficiency.
problem Adapting machine learning models to new data distributions with minimal access.
method Optimal transport between Gaussian Mixture Models (GMMs) for domain adaptation.
result Our methods are more efficient and scalable with sample size and dimensions.
New approach to meta-learning with variational Bayes for unlabeled data.
problem Improving machine learning systems' adaptability to small data.
method Generative meta-learning using AEVB and mean-field variational Bayes.
result Relevant VB updates do not depend on generative neural networks for certain models.
Paper introduces effect-invariance for better policy generalization.
problem Adapting policies to unseen environments efficiently.
method Introduces effect-invariance, a relaxation of full invariance, and develops testing procedures to test e-invariance directly from data.
result Effect-invariance enables zero-shot and few-shot policy generalization without assuming a causal graph.
Meta-RL algorithm improves sample efficiency and adaptability.
problem Challenges in meta-reinforcement learning, especially on-policy experience and task uncertainty.
method Develops an off-policy meta-RL algorithm that probabilistically infers task variables.
result Significantly outperforms prior algorithms in sample efficiency and asymptotic performance.
CVPR 2020 challenge evaluates continual learning in computer vision.
problem Making AI systems more adaptive and efficient.
method Evaluated different continual learning approaches on a common hardware with shared metrics.
result Reported main results, finalists, and prize winners.
Algorithm learns new tasks efficiently from past experience.
problem Lack of robustness to distributional shift in meta-reinforcement learning.
method Model Identification and Experience Relabeling (MIER) using dynamics models.
result Efficient extrapolation to out-of-distribution tasks.
AdMRL improves meta-reinforcement learning by minimizing worst-case sub-optimality gap.
problem Meta-reinforcement learning's sensitivity to task distribution shift.
method Model-based adversarial approach with minimax objective and alternating optimization.
result Efficacy in worst-case performance, generalization to out-of-distribution tasks, and sample efficiency.
This paper introduces Probability Engineering to improve deep learning models.
problem Challenges in traditional probabilistic modeling for AI applications.
method Treats learned probability distributions as engineering artifacts and actively modifies them.
result Improves robustness, efficiency, adaptability, and trustworthiness of deep learning models.
DoRA improves adaptation efficiency for large models by factoring norms and fusing kernels.
problem High-rank DoRA is computationally expensive and infeasible on common GPUs.
method Factored norms and fused Triton kernels to reduce memory and speed up computation.
result Fused implementation is up to 2.0x faster for inference and 1.9x faster for gradient computation.