Specialty
A preprint describes a Frame Kernel Method for learning partial differential equations with multiple spatial scales. It reports the lowest error on most tested benchmark problems, while its proposed explanation for unusually fast convergence remains a conjecture.
Scientific publication4 min read
A verifier-based method recorded sizable gains over outcome-level GRPO on ALFWorld and WebShop, while its audits showed that proof-based credit was sometimes unavailable.
Scientific publication4 min read
An arXiv preprint combines a worst-case analysis of softmax approximation rank with a limited learned-head audit, finding a sharp intrinsic geometry law but no added held-out signal from native coordinates.
Scientific publication5 min read
A conceptual note argues that Monte Carlo Tree Search can be understood as every-visit Monte Carlo control when the comparison is limited to trajectory sampling and Monte Carlo action-value updating. The claim clarifies terminology and computational scope, but does not compare performance.
Scientific publication4 min read
A theoretical and synthetic analysis finds that conditional flow matching can replace endpoint likelihood calculations only when specific residual errors cancel. In on-policy training, the shortcut may still improve reward even when its likelihood ratios are far from exact.
Scientific publication5 min read
A preprint introduces egRUE, a method that combines uncertainty scoring with feature-level explanations; its reported gains came from benchmark tests and a small BloodMNIST expert study.
Scientific publication5 min read
Gibbs-family methods led the aggregate scores in Traffic Hourly, Electricity Hourly and Solar Weekly, but classical baselines remained on top in some M4 frequency and disagreement groups.
Scientific publication4 min read
A theoretical and simulation study suggests that private mean estimation can outperform non-private estimation over time when leakage-participation feedback is strong enough.
Scientific publication5 min read
D-TAIA combined parameter-efficient language-model adaptation, domain-aware pre-training and retrieval, then matched or improved on LLM and RNN baselines across four event logs.
Scientific publication5 min read
Spectral and frequency-based features gave the clearest signal for detecting respiratory events in ballistocardiography recordings, with nonlinear classifiers performing strongly when each patient was held out for testing. The results point toward compact systems, but remain limited to one hospital-based sensor setup and cohort.
Scientific publication5 min read
A preprint reports higher average accuracy, lower variability and better average ranks for a residual-guided neural-network procedure tested against RVFL, ELM and BLS baselines on 71 UCI datasets.
Scientific publication4 min read
A computational preprint reports that TransMod had the lowest listed forecasting errors in New York City and Chicago and remained competitive when ride-hailing data were limited.
Scientific publication4 min read
A mathematical preprint reports a proof of Colombo's determinant conjecture for even-dimensional difference-power matrices with pairwise-distinct real nodes. It also gives an exact rank formula and determinant sign rule, while the formal verification described covers the odd-exponent derivation.
Scientific publication5 min read
A computational study reported zero mean final error for Mycelial Search on one benchmark function at two tested dimensions and the lowest reported mean on another at the higher dimension, while other tests showed uneven performance.
Scientific publication4 min read
A preprint describes a mixed-precision approach that assigns bit widths layer by layer using sensitivity estimates and reports quality gains near three-bit compression, while AWQ remains faster in the tested speed comparison.
Scientific publication4 min read
A preprint proposes a five-stage framework for systematic trading that charges model complexity and search effort against an effective-sample budget. Its one-index test found no robust position, and the authors say the work does not establish profitability.
Scientific publication5 min read
A mathematical preprint reports an exponential width gap across adjacent ReLU depths and a separate exact depth-4 versus depth-3 separation.
Scientific publication4 min read
A new computational study reports that deeper lookahead can make Whittle-index approximations more accurate for partially observable restless bandits, with a measured runtime cost.
Scientific publication4 min read
An analytic example shows that an exact FullCP region can be star-shaped without being convex, while a two-dimensional simulation found robust nonconvexity witnesses often but with small normalized gaps.
Scientific publication5 min read
PRQ-KMeans reported higher retrieval scores than RQ-KMeans in industrial search and across four public recommendation benchmarks, alongside higher codebook-use measures.
Scientific publication3 min read
A preprint presents OPDVR, a gated on-policy distillation method that combines teacher guidance with verifiable reward. It reports higher average accuracy than sampled-token OPD in same- and cross-architecture tests, alongside a GRPD extension that also outperformed GRPO on the reported benchmarks.
Scientific publication4 min read
A preprint's KENDO method replaced MCMC hyperparameter sampling with a weighted kernel ensemble and produced leading benchmark results with less per-iteration computation.
Scientific publication4 min read
A preprint describes a model that selectively shares information among disease-specific mobility outcomes. It beat eight comparison methods on held-out prediction scores, but exploratory disability classifications were not validated for prospective clinical use.
Scientific publication5 min read
A computational case study found that more varied first tokens in refusal completions were associated with higher stable rank and smaller refusal changes after a target-set-adapted single-vector ablation. The pattern appeared in frozen-model analyses and controlled fine-tuning, but the study did not establish transfer to unseen prompts.
Scientific publication5 min read
An experiment found that per-entity LoRA adapters could answer held-out single-answer questions without source text, while the tested ways to select the correct adapter from a query failed.
Scientific publication5 min read
A methods study reported faster runs in two digital-evolution workloads, but also showed why runtime tails, hardware anomalies and migration bias need monitoring.
Scientific publication5 min read
A new policy for language-model agents uses task information and signs of trouble during a task to decide when to make a permanent switch to a stronger model. The preprint reports better success-cost results than several routing strategies, while showing a less decisive comparison on a small custom benchmark.
Scientific publication5 min read
A continual-learning framework topped reported accuracy comparisons on most tested process streams, but ran more slowly than lightweight baselines.
Scientific publication4 min read
The analysis gives HFHRMC explicit convergence and iteration bounds for nonconvex sampling targets, but its certified advantage is confined to a lower-order finite-accuracy term.
Scientific publication5 min read
A memory-augmented model scored higher than a Transformer across three neural decoding benchmarks when training data were limited, while results varied with sequence context and model size.
Scientific publication5 min read
A four-model test found that decode-phase GPU energy rose 16.98% to 17.92% for two MHA models as context grew from 128 to 1,800 tokens, compared with about 3.32% to 3.62% for two GQA-based models. Increasing batch size from one to eight was associated with more than 80% lower energy per generated token in nearly all configurations.
Scientific publication4 min read
A computational study reports that GRAPE, a local Bayesian-optimization method, used fewer attack queries and finished with the lowest prompt regret across four embedding dimensions.
Scientific publication3 min read
An evaluation of Flower Hub found task-dependent results across five federated-learning benchmarks and reported that the same application could run in simulation and deployment without source-code changes.
Scientific publication4 min read
The theoretical analysis says fresh unlinked rows cannot distinguish shared behavior from unit-specific behavior, while trusted linked pairs reveal only limited structure.
Scientific publication4 min read
A preprint combines representation learning with conditional generation and reports stronger agreement between related outputs in a low-dimensional synthetic benchmark. A shuffled-condition test was consistent with condition use, while mode balance remained imperfect and transfer to natural data was not established.
Scientific publication5 min read
A nine-player modeling study evaluated PART, a multimodal framework that combines several tennis data streams to estimate wellness, injury risk, physical capability and playing style. Its reported scores apply to this dataset, with no external validation population reported.
2025 IEEE 5th International Conference on Human-Machine Systems (ICHMS), pp. 28-34, 20254 min read
A study of time-series forecasting tests when text-based context adds information beyond the latest observations and finds sharply different results across datasets.
Scientific publication4 min read
A new arXiv preprint reports that attack transfer was associated with differences between attacker and victim models and their client data. In simulations on CIFAR-10 and SVHN, its proposed defense generally scored higher against four transfer-based attacks than Federated Adversarial Training, while clean accuracy remained competitive.
Scientific publication4 min read
The matched benchmark results favored different planners on different discrete tasks, while BFN-RL remained competitive in the reported continuous-control comparison.
Scientific publication3 min read
A proof-based arXiv analysis finds matching worst-case bounds for alternating regret in the expert problem and general online convex optimization. Its broader lower bound uses a constructed compact convex domain, so it does not establish the same rate for every fixed domain.
Scientific publication3 min read