{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/computational-efficiency/papers/17","list_of":"/task/computational-efficiency","task":"Computational Efficiency","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":17,"pages_in_order":49,"rows_per_page":100,"rows":[1601,1700],"of":4891,"counts":{"archive_papers_tagged":4891,"with_a_code_link":1644,"where_syntology_ran_a_sample":369,"not_listed_spam_title":0,"listed":4891,"listed_where_code_ran":369,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":307,"every_run_a_failure_of_syntologys_instrument":62,"listed_with_a_run_with_no_instrument_failure":307,"listed_every_run_a_failure_of_syntologys_instrument":62,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/computational-efficiency","prev":"/task/computational-efficiency/papers/16","next":"/task/computational-efficiency/papers/18","papers":[{"url":"/paper/fastnet","slug":"fastnet","title":"FastNet","date":"2018-01-17","arxiv_id":"1802.02186","repositories_listed":1,"syntology":null},{"url":"/paper/debiasing-evidence-approximations-on","slug":"debiasing-evidence-approximations-on","title":"Debiasing Evidence Approximations: On Importance-weighted Autoencoders and Jackknife Variational Inference","date":"2018-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/clcnet-improving-the-efficiency-of","slug":"clcnet-improving-the-efficiency-of","title":"clcNet: Improving the Efficiency of Convolutional Neural Network using Channel Local Convolutions","date":"2017-12-17","arxiv_id":"1712.06145","repositories_listed":1,"syntology":null},{"url":"/paper/achieving-the-time-of-1-nn-but-the-accuracy","slug":"achieving-the-time-of-1-nn-but-the-accuracy","title":"Achieving the time of $1$-NN, but the accuracy of $k$-NN","date":"2017-12-06","arxiv_id":"1712.02369","repositories_listed":1,"syntology":null},{"url":"/paper/adabatch-adaptive-batch-sizes-for-training","slug":"adabatch-adaptive-batch-sizes-for-training","title":"AdaBatch: Adaptive Batch Sizes for Training Deep Neural Networks","date":"2017-12-06","arxiv_id":"1712.02029","repositories_listed":1,"syntology":null},{"url":"/paper/accelerated-alternating-projections-for","slug":"accelerated-alternating-projections-for","title":"Accelerated Alternating Projections for Robust Principal Component Analysis","date":"2017-11-15","arxiv_id":"1711.05519","repositories_listed":1,"syntology":null},{"url":"/paper/grafting-for-combinatorial-boolean-model","slug":"grafting-for-combinatorial-boolean-model","title":"Grafting for Combinatorial Boolean Model using Frequent Itemset Mining","date":"2017-11-07","arxiv_id":"1711.02478","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-conjugate-gradient-algorithm-with","slug":"stochastic-conjugate-gradient-algorithm-with","title":"Stochastic Conjugate Gradient Algorithm with Variance Reduction","date":"2017-10-27","arxiv_id":"1710.09979","repositories_listed":1,"syntology":null},{"url":"/paper/lasso-regularization-paths-for-narmax-models","slug":"lasso-regularization-paths-for-narmax-models","title":"Lasso Regularization Paths for NARMAX Models via Coordinate Descent","date":"2017-10-02","arxiv_id":"1710.00598","repositories_listed":1,"syntology":null},{"url":"/paper/image-super-resolution-using-dense-skip","slug":"image-super-resolution-using-dense-skip","title":"Image Super-Resolution Using Dense Skip Connections","date":"2017-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/dpc-net-deep-pose-correction-for-visual","slug":"dpc-net-deep-pose-correction-for-visual","title":"DPC-Net: Deep Pose Correction for Visual Localization","date":"2017-09-10","arxiv_id":"1709.03128","repositories_listed":1,"syntology":null},{"url":"/paper/attentional-correlation-filter-network-for-1","slug":"attentional-correlation-filter-network-for-1","title":"Attentional Correlation Filter Network for Adaptive Visual Tracking","date":"2017-07-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/featsel-a-framework-for-benchmarking-of","slug":"featsel-a-framework-for-benchmarking-of","title":"featsel: A framework for benchmarking of feature selection algorithms and cost functions","date":"2017-07-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/the-ratio-of-normalizing-constants-for","slug":"the-ratio-of-normalizing-constants-for","title":"Accelerating Bayesian Structure Learning in Sparse Gaussian Graphical Models","date":"2017-06-14","arxiv_id":"1706.04416","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-and-principled-score-estimation","slug":"efficient-and-principled-score-estimation","title":"Efficient and principled score estimation with Nyström kernel exponential families","date":"2017-05-23","arxiv_id":"1705.08360","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-using-localized-geometric","slug":"learning-to-rank-using-localized-geometric","title":"Learning to Rank Using Localized Geometric Mean Metrics","date":"2017-05-22","arxiv_id":"1705.07563","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-isolation-forest-application-to","slug":"hybrid-isolation-forest-application-to","title":"Hybrid Isolation Forest - Application to Intrusion Detection","date":"2017-05-10","arxiv_id":"1705.03800","repositories_listed":1,"syntology":null},{"url":"/paper/superpixel-segmentation-using-gaussian","slug":"superpixel-segmentation-using-gaussian","title":"Superpixel Segmentation Using Gaussian Mixture Model","date":"2016-12-28","arxiv_id":"1612.08792","repositories_listed":1,"syntology":null},{"url":"/paper/spatially-adaptive-computation-time-for","slug":"spatially-adaptive-computation-time-for","title":"Spatially Adaptive Computation Time for Residual Networks","date":"2016-12-07","arxiv_id":"1612.02297","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/spatially-adaptive-computation-time-for#ran","syntology_url":"https://syntology.ai/paper/1612.02297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.02297"}},"official":{"repos":["mfigurnov/sact"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/dis-s2v-discourse-informed-sen2vec","slug":"dis-s2v-discourse-informed-sen2vec","title":"Dis-S2V: Discourse Informed Sen2Vec","date":"2016-10-25","arxiv_id":"1610.08078","repositories_listed":1,"syntology":null},{"url":"/paper/adagio-fast-data-aware-near-isometric-linear","slug":"adagio-fast-data-aware-near-isometric-linear","title":"ADAGIO: Fast Data-aware Near-Isometric Linear Embeddings","date":"2016-09-17","arxiv_id":"1609.05388","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-kernel-methods-for-independence","slug":"large-scale-kernel-methods-for-independence","title":"Large-Scale Kernel Methods for Independence Testing","date":"2016-06-25","arxiv_id":"1606.07892","repositories_listed":1,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/large-scale-kernel-methods-for-independence#ran","syntology_url":"https://syntology.ai/paper/1606.07892","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.07892"}},"official":null}},{"url":"/paper/online-human-action-detection-using-joint","slug":"online-human-action-detection-using-joint","title":"Online Human Action Detection using Joint Classification-Regression Recurrent Neural Networks","date":"2016-04-19","arxiv_id":"1604.05633","repositories_listed":1,"syntology":null},{"url":"/paper/depth-based-object-tracking-using-a-robust","slug":"depth-based-object-tracking-using-a-robust","title":"Depth-Based Object Tracking Using a Robust Gaussian Filter","date":"2016-02-19","arxiv_id":"1602.06157","repositories_listed":1,"syntology":null},{"url":"/paper/the-demodulated-band-transform","slug":"the-demodulated-band-transform","title":"The demodulated band transform","date":"2016-01-19","arxiv_id":"1510.03113","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-variational-models","slug":"hierarchical-variational-models","title":"Hierarchical Variational Models","date":"2015-11-07","arxiv_id":"1511.02386","repositories_listed":1,"syntology":null},{"url":"/paper/compact-convolutional-neural-network-cascade","slug":"compact-convolutional-neural-network-cascade","title":"Compact Convolutional Neural Network Cascade for Face Detection","date":"2015-08-06","arxiv_id":"1508.01292","repositories_listed":1,"syntology":null},{"url":"/paper/hamiltonian-monte-carlo-acceleration-using","slug":"hamiltonian-monte-carlo-acceleration-using","title":"Hamiltonian Monte Carlo Acceleration Using Surrogate Functions with Random Bases","date":"2015-06-18","arxiv_id":"1506.05555","repositories_listed":1,"syntology":null},{"url":"/paper/a-practical-guide-to-randomized-matrix","slug":"a-practical-guide-to-randomized-matrix","title":"A Practical Guide to Randomized Matrix Computations with MATLAB Implementations","date":"2015-05-28","arxiv_id":"1505.07570","repositories_listed":1,"syntology":null},{"url":"/paper/template-kernels-for-dependency-parsing","slug":"template-kernels-for-dependency-parsing","title":"Template Kernels for Dependency Parsing","date":"2015-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/kernel-manifold-alignment","slug":"kernel-manifold-alignment","title":"Kernel Manifold Alignment","date":"2015-04-09","arxiv_id":"1504.02338","repositories_listed":1,"syntology":null},{"url":"/paper/maxdnn-an-efficient-convolution-kernel-for","slug":"maxdnn-an-efficient-convolution-kernel-for","title":"maxDNN: An Efficient Convolution Kernel for Deep Learning with Maxwell GPUs","date":"2015-01-27","arxiv_id":"1501.06633","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-computational-efficiency-of-training","slug":"on-the-computational-efficiency-of-training","title":"On the Computational Efficiency of Training Neural Networks","date":"2014-10-05","arxiv_id":"1410.1141","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-computational-efficiency-of-training#ran","syntology_url":"https://syntology.ai/paper/1410.1141","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1410.1141"}},"official":null}},{"url":"/paper/sparse-estimation-with-the-swept-approximated","slug":"sparse-estimation-with-the-swept-approximated","title":"Sparse Estimation with the Swept Approximated Message-Passing Algorithm","date":"2014-06-17","arxiv_id":"1406.4311","repositories_listed":1,"syntology":null},{"url":"/paper/inference-of-sparse-networks-with-unobserved","slug":"inference-of-sparse-networks-with-unobserved","title":"Inference of Sparse Networks with Unobserved Variables. Application to Gene Regulatory Networks","date":"2014-06-01","arxiv_id":"1406.0193","repositories_listed":1,"syntology":null},{"url":"/paper/single-camera-pose-estimation-using-bayesian","slug":"single-camera-pose-estimation-using-bayesian","title":"Single camera pose estimation using Bayesian filtering and Kinect motion priors","date":"2014-05-20","arxiv_id":"1405.5047","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-neural-networks-for-genetic","slug":"bayesian-neural-networks-for-genetic","title":"Bayesian Neural Networks for Genetic Association Studies of Complex Disease","date":"2014-04-15","arxiv_id":"1404.3989","repositories_listed":1,"syntology":null},{"url":"/paper/binary-stereo-matching","slug":"binary-stereo-matching","title":"Binary Stereo Matching","date":"2014-02-10","arxiv_id":"1402.2020","repositories_listed":1,"syntology":null},{"url":"/paper/parallelizing-mcmc-via-weierstrass-sampler","slug":"parallelizing-mcmc-via-weierstrass-sampler","title":"Parallelizing MCMC via Weierstrass Sampler","date":"2013-12-17","arxiv_id":"1312.4605","repositories_listed":1,"syntology":null},{"url":"/paper/fast-large-scale-optimization-by-unifying","slug":"fast-large-scale-optimization-by-unifying","title":"Fast large-scale optimization by unifying stochastic gradient and quasi-Newton methods","date":"2013-11-09","arxiv_id":"1311.2115","repositories_listed":1,"syntology":null},{"url":"/paper/online-tensor-methods-for-learning-latent","slug":"online-tensor-methods-for-learning-latent","title":"Online Tensor Methods for Learning Latent Variable Models","date":"2013-09-03","arxiv_id":"1309.0787","repositories_listed":1,"syntology":null},{"url":"/paper/debacl-a-python-package-for-interactive","slug":"debacl-a-python-package-for-interactive","title":"DeBaCl: A Python Package for Interactive DEnsity-BAsed CLustering","date":"2013-07-30","arxiv_id":"1307.8136","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/debacl-a-python-package-for-interactive#ran","syntology_url":"https://syntology.ai/paper/1307.8136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1307.8136"}},"official":{"repos":["CoAxLab/DeBaCl"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/a-comparison-of-lauritzen-spiegelhalter-hugin","slug":"a-comparison-of-lauritzen-spiegelhalter-hugin","title":"A Comparison of Lauritzen-Spiegelhalter, Hugin, and Shenoy-Shafer Architectures for Computing Marginals of Probability Distributions","date":"2013-01-30","arxiv_id":"1301.7394","repositories_listed":1,"syntology":null},{"url":"/paper/a-comparative-study-of-efficient","slug":"a-comparative-study-of-efficient","title":"A Comparative Study of Efficient Initialization Methods for the K-Means Clustering Algorithm","date":"2012-09-10","arxiv_id":"1209.1960","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-comparative-study-of-efficient#ran","syntology_url":"https://syntology.ai/paper/1209.1960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1209.1960"}},"official":null}},{"url":null,"slug":"a-framework-for-waterfall-pricing-using","title":"A Framework for Waterfall Pricing Using Simulation-Based Uncertainty Modeling","date":"2025-07-17","arxiv_id":"2507.13324","repositories_listed":0,"syntology":null},{"url":null,"slug":"computational-statistical-tradeoffs-from-np","title":"Computational-Statistical Tradeoffs from NP-hardness","date":"2025-07-17","arxiv_id":"2507.13222","repositories_listed":0,"syntology":null},{"url":null,"slug":"fremer-lightweight-and-effective-frequency","title":"Fremer: Lightweight and Effective Frequency Transformer for Workload Forecasting in Cloud Services","date":"2025-07-17","arxiv_id":"2507.12908","repositories_listed":0,"syntology":null},{"url":null,"slug":"fortress-function-composition-optimized-real","title":"FORTRESS: Function-composition Optimized Real-Time Resilient Structural Segmentation via Kolmogorov-Arnold Enhanced Spatial Attention Networks","date":"2025-07-16","arxiv_id":"2507.12675","repositories_listed":0,"syntology":null},{"url":null,"slug":"heat-kernel-goes-topological","title":"Heat Kernel Goes Topological","date":"2025-07-16","arxiv_id":"2507.12380","repositories_listed":0,"syntology":null},{"url":null,"slug":"canonical-bayesian-linear-system","title":"Canonical Bayesian Linear System Identification","date":"2025-07-15","arxiv_id":"2507.11535","repositories_listed":0,"syntology":null},{"url":null,"slug":"recursive-bound-constrained-adagrad-with","title":"Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization","date":"2025-07-15","arxiv_id":"2507.11513","repositories_listed":0,"syntology":null},{"url":null,"slug":"lightweight-model-for-poultry-disease","title":"Lightweight Model for Poultry Disease Detection from Fecal Images Using Multi-Color Space Feature Optimization and Machine Learning","date":"2025-07-14","arxiv_id":"2507.10056","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparative-analysis-of-vision-transformers","title":"Comparative Analysis of Vision Transformers and Traditional Deep Learning Approaches for Automated Pneumonia Detection in Chest X-Rays","date":"2025-07-11","arxiv_id":"2507.10589","repositories_listed":0,"syntology":null},{"url":null,"slug":"recurrent-u-net-based-graph-neural-network","title":"Recurrent U-Net-Based Graph Neural Network (RUGNN) for Accurate Deformation Predictions in Sheet Material Forming","date":"2025-07-10","arxiv_id":"2507.11547","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-gaussian-processes-under-monotonicity","title":"Fast Gaussian Processes under Monotonicity Constraints","date":"2025-07-09","arxiv_id":"2507.06677","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparative-analysis-of-cnn-and-transformer","title":"Comparative Analysis of CNN and Transformer Architectures with Heart Cycle Normalization for Automated Phonocardiogram Classification","date":"2025-07-08","arxiv_id":"2507.07058","repositories_listed":0,"syntology":null},{"url":null,"slug":"critical-nodes-identification-in-complex","title":"Critical Nodes Identification in Complex Networks: A Survey","date":"2025-07-08","arxiv_id":"2507.06164","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperspectral-anomaly-detection-methods-a","title":"Hyperspectral Anomaly Detection Methods: A Survey and Comparative Study","date":"2025-07-08","arxiv_id":"2507.05730","repositories_listed":0,"syntology":null},{"url":null,"slug":"qs4d-quantization-aware-training-for","title":"QS4D: Quantization-aware training for efficient hardware deployment of structured state-space sequential models","date":"2025-07-08","arxiv_id":"2507.06079","repositories_listed":0,"syntology":null},{"url":null,"slug":"dc-ar-efficient-masked-autoregressive-image","title":"DC-AR: Efficient Masked Autoregressive Image Generation with Deep Compression Hybrid Tokenizer","date":"2025-07-07","arxiv_id":"2507.04947","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-order-collaboration-oriented-federated","title":"High Order Collaboration-Oriented Federated Graph Neural Network for Accurate QoS Prediction","date":"2025-07-07","arxiv_id":"2507.05308","repositories_listed":0,"syntology":null},{"url":null,"slug":"chain-of-thought-enhanced-shallow","title":"Chain-of-Thought Enhanced Shallow Transformers for Wireless Symbol Detection","date":"2025-06-26","arxiv_id":"2506.21093","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-cross-channel-hierarchical","title":"Distributed Cross-Channel Hierarchical Aggregation for Foundation Models","date":"2025-06-26","arxiv_id":"2506.21411","repositories_listed":0,"syntology":null},{"url":null,"slug":"fastref-fast-prototype-refinement-for-few","title":"FastRef:Fast Prototype Refinement for Few-Shot Industrial Anomaly Detection","date":"2025-06-26","arxiv_id":"2506.21398","repositories_listed":0,"syntology":null},{"url":null,"slug":"llm-guided-chemical-process-optimization-with","title":"LLM-guided Chemical Process Optimization with a Multi-Agent Approach","date":"2025-06-26","arxiv_id":"2506.20921","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimising-4th-order-runge-kutta-methods-a","title":"Optimising 4th-Order Runge-Kutta Methods: A Dynamic Heuristic Approach for Efficiency and Low Storage","date":"2025-06-26","arxiv_id":"2506.21465","repositories_listed":0,"syntology":null},{"url":null,"slug":"topk-language-models","title":"TopK Language Models","date":"2025-06-26","arxiv_id":"2506.21468","repositories_listed":0,"syntology":null},{"url":null,"slug":"divide-specialize-and-route-a-new-approach-to","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","date":"2025-06-25","arxiv_id":"2506.20814","repositories_listed":0,"syntology":null},{"url":null,"slug":"itformer-bridging-time-series-and-natural","title":"ITFormer: Bridging Time Series and Natural Language for Multi-Modal QA with Large-Scale Multitask Dataset","date":"2025-06-25","arxiv_id":"2506.20093","repositories_listed":0,"syntology":null},{"url":null,"slug":"lightweight-multi-frame-integration-for","title":"Lightweight Multi-Frame Integration for Robust YOLO Object Detection in Videos","date":"2025-06-25","arxiv_id":"2506.20550","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-champagne-sparse-bayesian-learning","title":"Revisiting CHAMPAGNE: Sparse Bayesian Learning as Reweighted Sparse Coding","date":"2025-06-25","arxiv_id":"2506.20534","repositories_listed":0,"syntology":null},{"url":null,"slug":"cam-net-an-ai-model-for-whole-atmosphere-with","title":"CAM-NET: An AI Model for Whole Atmosphere with Thermosphere and Ionosphere Extension","date":"2025-06-24","arxiv_id":"2506.19340","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-scale-spatial-attention-based-zero","title":"A Multi-Scale Spatial Attention-Based Zero-Shot Learning Framework for Low-Light Image Enhancement","date":"2025-06-23","arxiv_id":"2506.18323","repositories_listed":0,"syntology":null},{"url":null,"slug":"vhu-net-variational-hadamard-u-net-for-body","title":"VHU-Net: Variational Hadamard U-Net for Body MRI Bias Field Correction","date":"2025-06-23","arxiv_id":"2506.19181","repositories_listed":0,"syntology":null},{"url":null,"slug":"cooperative-bistatic-isac-systems-for-low","title":"Cooperative Bistatic ISAC Systems for Low-Altitude Economy","date":"2025-06-22","arxiv_id":"2506.18067","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-temporal-positional-encodings-for","title":"Dynamic Temporal Positional Encodings for Early Intrusion Detection in IoT","date":"2025-06-22","arxiv_id":"2506.18114","repositories_listed":0,"syntology":null},{"url":null,"slug":"lfr-pino-a-layered-fourier-reduced-physics","title":"LFR-PINO: A Layered Fourier Reduced Physics-Informed Neural Operator for Parametric PDEs","date":"2025-06-21","arxiv_id":"2506.17582","repositories_listed":0,"syntology":null},{"url":null,"slug":"residual-connection-enhanced-convlstm-for","title":"Residual Connection-Enhanced ConvLSTM for Lithium Dendrite Growth Prediction","date":"2025-06-21","arxiv_id":"2506.17756","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-machine-learning-algorithms-using","title":"Scalable Machine Learning Algorithms using Path Signatures","date":"2025-06-21","arxiv_id":"2506.17634","repositories_listed":0,"syntology":null},{"url":null,"slug":"client-selection-strategies-for-federated","title":"Client Selection Strategies for Federated Semantic Communications in Heterogeneous IoT Networks","date":"2025-06-20","arxiv_id":"2506.17063","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-modal-obfuscation-for-jailbreak-attacks","title":"Cross-Modal Obfuscation for Jailbreak Attacks on Large Vision-Language Models","date":"2025-06-20","arxiv_id":"2506.16760","repositories_listed":0,"syntology":null},{"url":null,"slug":"multimodal-fused-learning-for-solving-the","title":"Multimodal Fused Learning for Solving the Generalized Traveling Salesman Problem in Robotic Task Planning","date":"2025-06-20","arxiv_id":"2506.16931","repositories_listed":0,"syntology":null},{"url":null,"slug":"omnireflect-discovering-transferable","title":"OmniReflect: Discovering Transferable Constitutions for LLM agents via Neuro-Symbolic Reflections","date":"2025-06-20","arxiv_id":"2506.17449","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-depth-of-neural-networks","title":"Optimal Depth of Neural Networks","date":"2025-06-20","arxiv_id":"2506.16862","repositories_listed":0,"syntology":null},{"url":null,"slug":"pet-tracer-separation-using-conditional","title":"PET Tracer Separation Using Conditional Diffusion Transformer with Multi-latent Space Learning","date":"2025-06-20","arxiv_id":"2506.16934","repositories_listed":0,"syntology":null},{"url":null,"slug":"speeding-up-local-optimization-in-vehicle","title":"Speeding up Local Optimization in Vehicle Routing with Tensor-based GPU Acceleration","date":"2025-06-20","arxiv_id":"2506.17357","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-transformations-in-deep-learning","title":"Efficient Transformations in Deep Learning Convolutional Neural Networks","date":"2025-06-19","arxiv_id":"2506.16418","repositories_listed":0,"syntology":null},{"url":null,"slug":"flowram-grounding-flow-matching-policy-with-1","title":"FlowRAM: Grounding Flow Matching Policy with Region-Aware Mamba Framework for Robotic Manipulation","date":"2025-06-19","arxiv_id":"2506.16201","repositories_listed":0,"syntology":null},{"url":null,"slug":"moirexnet-adaptive-multi-scale-demoireing","title":"MoiréXNet: Adaptive Multi-Scale Demoiréing with Linear Attention Test-Time Training and Truncated Flow Matching Prior","date":"2025-06-19","arxiv_id":"2506.15929","repositories_listed":0,"syntology":null},{"url":null,"slug":"brain-stroke-classification-using-wavelet","title":"Brain Stroke Classification Using Wavelet Transform and MLP Neural Networks on DWI MRI Images","date":"2025-06-18","arxiv_id":"2506.15364","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-malware-detection-with-optimized","title":"Efficient Malware Detection with Optimized Learning on High-Dimensional Features","date":"2025-06-18","arxiv_id":"2506.17309","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-one-run-privacy-auditing-with","title":"Enhancing One-run Privacy Auditing with Quantile Regression-Based Membership Inference","date":"2025-06-18","arxiv_id":"2506.15349","repositories_listed":0,"syntology":null},{"url":null,"slug":"islanding-strategy-for-smart-grids-oriented","title":"Islanding Strategy for Smart Grids Oriented to Resilience Enhancement and Its Power Supply Range Optimization","date":"2025-06-18","arxiv_id":"2506.15191","repositories_listed":0,"syntology":null},{"url":null,"slug":"accurate-and-scalable-exchange-correlation","title":"Accurate and scalable exchange-correlation with deep learning","date":"2025-06-17","arxiv_id":"2506.14665","repositories_listed":0,"syntology":null},{"url":null,"slug":"swarm-stl-a-framework-for-motion-planning-in","title":"Swarm-STL: A Framework for Motion Planning in Large-Scale, Multi-Swarm Systems","date":"2025-06-17","arxiv_id":"2506.14749","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comprehensive-survey-on-deep-learning-1","title":"A Comprehensive Survey on Deep Learning Solutions for 3D Flood Mapping","date":"2025-06-16","arxiv_id":"2506.13201","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-memetic-walrus-algorithm-with-expert-guided","title":"A Memetic Walrus Algorithm with Expert-guided Strategy for Adaptive Curriculum Sequencing","date":"2025-06-16","arxiv_id":"2506.13092","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-technical-study-into-small-reasoning","title":"A Technical Study into Small Reasoning Language Models","date":"2025-06-16","arxiv_id":"2506.13404","repositories_listed":0,"syntology":null},{"url":null,"slug":"avoiding-obfuscation-with-prover-estimator","title":"Avoiding Obfuscation with Prover-Estimator Debate","date":"2025-06-16","arxiv_id":"2506.13609","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-optimal-kernel-size-and-dimension-in","title":"Finding Optimal Kernel Size and Dimension in Convolutional Neural Networks An Architecture Optimization Approach","date":"2025-06-16","arxiv_id":"2506.14846","repositories_listed":0,"syntology":null}],"record_sha256":"35416e7c40615edd0c75cabd6a1f5c77106fd010b2c093bc74fced313f07ddcc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}