{"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/feature-compression","name":"Feature Compression","slug":"feature-compression","description_markdown":"Compress data for machine interpretability to perform downstream tasks, rather than for human perception.","categories":[{"name":"Computer Vision","url":"/area/computer-vision"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":96,"papers_with_code":28,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/image-compression","name":"Image Compression"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":96,"of":96,"of_with_code":28,"tagged_in_all":96,"counts":{"archive_papers_tagged":96,"with_a_code_link":28,"where_syntology_ran_a_sample":7,"not_listed_spam_title":0,"listed":96,"listed_where_code_ran":7,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":6,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"items":[{"url":"/paper/flexible-variable-rate-image-feature","slug":"flexible-variable-rate-image-feature","title":"Flexible Variable-Rate Image Feature Compression for Edge-Cloud Systems","date":"2024-03-30","arxiv_id":"2404.00432","repositories_listed":2,"syntology":null},{"url":"/paper/emiff-enhanced-multi-scale-image-feature","slug":"emiff-enhanced-multi-scale-image-feature","title":"EMIFF: Enhanced Multi-scale Image Feature Fusion for Vehicle-Infrastructure Cooperative 3D Object Detection","date":"2024-02-23","arxiv_id":"2402.15272","repositories_listed":2,"syntology":null},{"url":"/paper/vimi-vehicle-infrastructure-multi-view","slug":"vimi-vehicle-infrastructure-multi-view","title":"VIMI: Vehicle-Infrastructure Multi-view Intermediate Fusion for Camera-based 3D Object Detection","date":"2023-03-20","arxiv_id":"2303.10975","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vimi-vehicle-infrastructure-multi-view#ran","syntology_url":"https://syntology.ai/paper/2303.10975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.10975"}},"official":{"repos":["bosszhe/vimi"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/supervised-compression-for-resource","slug":"supervised-compression-for-resource","title":"Supervised Compression for Resource-Constrained Edge Computing Systems","date":"2021-08-21","arxiv_id":"2108.11898","repositories_listed":2,"syntology":{"n":17,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/supervised-compression-for-resource#ran","syntology_url":"https://syntology.ai/paper/2108.11898","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.11898"}},"official":{"repos":["yoshitomo-matsubara/supervised-compression"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/transvfc-a-transformable-video-feature","slug":"transvfc-a-transformable-video-feature","title":"TransVFC: A Transformable Video Feature Compression Framework for Machines","date":"2025-03-31","arxiv_id":"2503.23772","repositories_listed":1,"syntology":null},{"url":"/paper/llava-st-a-multimodal-large-language-model","slug":"llava-st-a-multimodal-large-language-model","title":"LLaVA-ST: A Multimodal Large Language Model for Fine-Grained Spatial-Temporal Understanding","date":"2025-01-14","arxiv_id":"2501.08282","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/llava-st-a-multimodal-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2501.08282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.08282"}},"official":{"repos":["appletea233/llava-st"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/meissonic-revitalizing-masked-generative","slug":"meissonic-revitalizing-masked-generative","title":"Meissonic: Revitalizing Masked Generative Transformers for Efficient High-Resolution Text-to-Image Synthesis","date":"2024-10-10","arxiv_id":"2410.08261","repositories_listed":1,"syntology":{"n":12,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/meissonic-revitalizing-masked-generative#ran","syntology_url":"https://syntology.ai/paper/2410.08261","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.08261"}},"official":{"repos":["viiika/Meissonic"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/entropy-loss-an-interpretability-amplifier-of","slug":"entropy-loss-an-interpretability-amplifier-of","title":"Entropy Loss: An Interpretability Amplifier of 3D Object Detection Network for Intelligent Driving","date":"2024-09-01","arxiv_id":"2409.00839","repositories_listed":1,"syntology":null},{"url":"/paper/i-2-vc-a-unified-framework-for-intra-inter","slug":"i-2-vc-a-unified-framework-for-intra-inter","title":"I$^2$VC: A Unified Framework for Intra- & Inter-frame Video Compression","date":"2024-05-23","arxiv_id":"2405.14336","repositories_listed":1,"syntology":null},{"url":"/paper/vector-quantization-for-recommender-systems-a","slug":"vector-quantization-for-recommender-systems-a","title":"Vector Quantization for Recommender Systems: A Review and Outlook","date":"2024-05-06","arxiv_id":"2405.03110","repositories_listed":1,"syntology":null},{"url":"/paper/fool-addressing-the-downlink-bottleneck-in","slug":"fool-addressing-the-downlink-bottleneck-in","title":"FOOL: Addressing the Downlink Bottleneck in Satellite Computing with Neural Feature Compression","date":"2024-03-25","arxiv_id":"2403.16677","repositories_listed":1,"syntology":null},{"url":"/paper/effective-communication-with-dynamic-feature","slug":"effective-communication-with-dynamic-feature","title":"Effective Communication with Dynamic Feature Compression","date":"2024-01-29","arxiv_id":"2401.16236","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-manipulate-artistic-images","slug":"learning-to-manipulate-artistic-images","title":"Learning to Manipulate Artistic Images","date":"2024-01-25","arxiv_id":"2401.13976","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-to-manipulate-artistic-images#ran","syntology_url":"https://syntology.ai/paper/2401.13976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.13976"}},"official":{"repos":["snailforce/sim-net"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/widthformer-toward-efficient-transformer","slug":"widthformer-toward-efficient-transformer","title":"WidthFormer: Toward Efficient Transformer-based BEV View Transformation","date":"2024-01-08","arxiv_id":"2401.03836","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-deep-representation-learning","slug":"understanding-deep-representation-learning","title":"Understanding Deep Representation Learning via Layerwise Feature Compression and Discrimination","date":"2023-11-06","arxiv_id":"2311.02960","repositories_listed":1,"syntology":{"n":17,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":17,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/understanding-deep-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2311.02960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02960"}},"official":{"repos":["heimine/pnc_dln"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-feature-selection-approach-for","slug":"end-to-end-feature-selection-approach-for","title":"End-to-end Feature Selection Approach for Learning Skinny Trees","date":"2023-10-28","arxiv_id":"2310.18542","repositories_listed":1,"syntology":null},{"url":"/paper/frankensplit-saliency-guided-neural-feature","slug":"frankensplit-saliency-guided-neural-feature","title":"FrankenSplit: Efficient Neural Feature Compression with Shallow Variational Bottleneck Injection for Mobile Edge Computing","date":"2023-02-21","arxiv_id":"2302.10681","repositories_listed":1,"syntology":null},{"url":"/paper/sgcn-exploiting-compressed-sparse-features-in","slug":"sgcn-exploiting-compressed-sparse-features-in","title":"SGCN: Exploiting Compressed-Sparse Features in Deep Graph Convolutional Network Accelerators","date":"2023-01-25","arxiv_id":"2301.10388","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-feature-compression-for-edge-cloud","slug":"efficient-feature-compression-for-edge-cloud","title":"Efficient Feature Compression for Edge-Cloud Systems","date":"2022-11-17","arxiv_id":"2211.09897","repositories_listed":1,"syntology":null},{"url":"/paper/features-compression-based-on-counterfactual","slug":"features-compression-based-on-counterfactual","title":"Supervised Feature Compression based on Counterfactual Analysis","date":"2022-11-17","arxiv_id":"2211.09894","repositories_listed":1,"syntology":null},{"url":"/paper/video-in-10-bits-few-bit-videoqa-for","slug":"video-in-10-bits-few-bit-videoqa-for","title":"Video in 10 Bits: Few-Bit VideoQA for Efficiency and Privacy","date":"2022-10-15","arxiv_id":"2210.08391","repositories_listed":1,"syntology":null},{"url":"/paper/compressing-features-for-learning-with-noisy","slug":"compressing-features-for-learning-with-noisy","title":"Compressing Features for Learning with Noisy Labels","date":"2022-06-27","arxiv_id":"2206.13140","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-collaborative-inference-via-dnn","slug":"multi-agent-collaborative-inference-via-dnn","title":"Multi-Agent Collaborative Inference via DNN Decoupling: Intermediate Feature Compression and Edge Learning","date":"2022-05-24","arxiv_id":"2205.11854","repositories_listed":1,"syntology":null},{"url":"/paper/sc2-supervised-compression-for-split","slug":"sc2-supervised-compression-for-split","title":"SC2 Benchmark: Supervised Compression for Split Computing","date":"2022-03-16","arxiv_id":"2203.08875","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-compilation-of-dnn-training","slug":"context-aware-compilation-of-dnn-training","title":"Context-Aware Compilation of DNN Training Pipelines across Edge and Cloud","date":"2021-12-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/lossy-compression-for-lossless-prediction","slug":"lossy-compression-for-lossless-prediction","title":"Lossy Compression for Lossless Prediction","date":"2021-06-21","arxiv_id":"2106.10800","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/lossy-compression-for-lossless-prediction#ran","syntology_url":"https://syntology.ai/paper/2106.10800","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10800"}},"official":{"repos":["YannDubs/lossyless"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/bottlenet-an-end-to-end-approach-for-feature","slug":"bottlenet-an-end-to-end-approach-for-feature","title":"BottleNet++: An End-to-End Approach for Feature Compression in Device-Edge Co-Inference Systems","date":"2019-10-31","arxiv_id":"1910.14315","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-deep-feature-compression-for","slug":"context-aware-deep-feature-compression-for","title":"Context-aware Deep Feature Compression for High-speed Visual Tracking","date":"2018-03-28","arxiv_id":"1803.10537","repositories_listed":1,"syntology":null},{"url":null,"slug":"cross-architecture-universal-feature-coding","title":"Cross-architecture universal feature coding via distribution alignment","date":"2025-06-15","arxiv_id":"2506.12737","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-drug-discovery-autoencoder-based","title":"Enhancing Drug Discovery: Autoencoder-Based Latent Space Augmentation for Improved Molecular Solubility Prediction using LatMixSol","date":"2025-05-30","arxiv_id":"2506.00223","repositories_listed":0,"syntology":null},{"url":null,"slug":"semfed-semantic-aware-resource-efficient","title":"SEMFED: Semantic-Aware Resource-Efficient Federated Learning for Heterogeneous NLP Tasks","date":"2025-05-26","arxiv_id":"2505.23801","repositories_listed":0,"syntology":null},{"url":null,"slug":"ucs-a-universal-model-for-curvilinear","title":"UCS: A Universal Model for Curvilinear Structure Segmentation","date":"2025-04-05","arxiv_id":"2504.04034","repositories_listed":0,"syntology":null},{"url":null,"slug":"selective-complementary-feature-fusion-and","title":"Selective Complementary Feature Fusion and Modal Feature Compression Interaction for Brain Tumor Segmentation","date":"2025-03-20","arxiv_id":"2503.16149","repositories_listed":0,"syntology":null},{"url":null,"slug":"task-oriented-feature-compression-for","title":"Task-Oriented Feature Compression for Multimodal Understanding via Device-Edge Co-Inference","date":"2025-03-17","arxiv_id":"2503.12926","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-domain-homogeneous-fusion-with-cross","title":"Dual-Domain Homogeneous Fusion with Cross-Modal Mamba and Progressive Decoder for 3D Object Detection","date":"2025-03-12","arxiv_id":"2503.08992","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-semantic-compression-for","title":"Hierarchical Semantic Compression for Consistent Image Semantic Restoration","date":"2025-02-24","arxiv_id":"2502.16799","repositories_listed":0,"syntology":null},{"url":null,"slug":"stereo-image-coding-for-machines-with-joint","title":"Stereo Image Coding for Machines with Joint Visual Feature Compression","date":"2025-02-20","arxiv_id":"2502.14190","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-large-recommendation-model","title":"An Efficient Large Recommendation Model: Towards a Resource-Optimal Scaling Law","date":"2025-02-14","arxiv_id":"2502.09888","repositories_listed":0,"syntology":null},{"url":null,"slug":"motionbench-benchmarking-and-improving-fine","title":"MotionBench: Benchmarking and Improving Fine-grained Video Motion Understanding for Vision Language Models","date":"2025-01-06","arxiv_id":"2501.02955","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-map-priors-for-collaborative-bev","title":"Generative Map Priors for Collaborative BEV Semantic Segmentation","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-aware-multi-device-cooperative-edge","title":"Privacy-Aware Multi-Device Cooperative Edge Inference with Distributed Resource Bidding","date":"2024-12-30","arxiv_id":"2412.21069","repositories_listed":0,"syntology":null},{"url":null,"slug":"structurally-consistent-mri-colorization","title":"Structurally Consistent MRI Colorization using Cross-modal Fusion Learning","date":"2024-12-12","arxiv_id":"2412.10452","repositories_listed":0,"syntology":null},{"url":null,"slug":"spikebottlenet-energy-efficient-spike-neural","title":"SpikeBottleNet: Spike-Driven Feature Compression Architecture for Edge-Cloud Co-Inference","date":"2024-10-11","arxiv_id":"2410.08673","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-scalable-image-feature-compression-a","title":"Toward Scalable Image Feature Compression: A Content-Adaptive and Diffusion-Based Approach","date":"2024-10-08","arxiv_id":"2410.06149","repositories_listed":0,"syntology":null},{"url":null,"slug":"distilling-channels-for-efficient-deep","title":"Distilling Channels for Efficient Deep Tracking","date":"2024-09-18","arxiv_id":"2409.11785","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-compression-for-cloud-edge-multimodal","title":"Feature Compression for Cloud-Edge Multimodal 3D Object Detection","date":"2024-09-06","arxiv_id":"2409.04123","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-unlocking-the-mystery-of-adversarial","title":"Towards unlocking the mystery of adversarial fragility of neural networks","date":"2024-06-23","arxiv_id":"2406.16200","repositories_listed":0,"syntology":null},{"url":null,"slug":"texture-guided-coding-for-deep-features","title":"Texture-guided Coding for Deep Features","date":"2024-05-30","arxiv_id":"2405.19669","repositories_listed":0,"syntology":null},{"url":null,"slug":"jointrf-end-to-end-joint-optimization-for","title":"JointRF: End-to-End Joint Optimization for Dynamic Neural Radiance Field Representation and Compression","date":"2024-05-23","arxiv_id":"2405.14452","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressive-feature-selection-for-remote","title":"Compressive Feature Selection for Remote Visual Multi-Task Inference","date":"2024-05-15","arxiv_id":"2405.09077","repositories_listed":0,"syntology":null},{"url":null,"slug":"dmofc-discrimination-metric-optimized-feature","title":"DMOFC: Discrimination Metric-Optimized Feature Compression","date":"2024-05-07","arxiv_id":"2405.04044","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-and-rate-adaptive-feature","title":"Distributed and Rate-Adaptive Feature Compression","date":"2024-04-02","arxiv_id":"2404.02179","repositories_listed":0,"syntology":null},{"url":null,"slug":"nerfcodec-neural-feature-compression-meets","title":"NeRFCodec: Neural Feature Compression Meets Neural Radiance Fields for Memory-Efficient Scene Representation","date":"2024-04-02","arxiv_id":"2404.02185","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-geometric-structure-of-topic-models","title":"The Geometric Structure of Topic Models","date":"2024-03-06","arxiv_id":"2403.03607","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-semantic-compression-for-cnn","title":"Dynamic Semantic Compression for CNN Inference in Multi-access Edge Computing: A Graph Reinforcement Learning-based Autoencoder","date":"2024-01-19","arxiv_id":"2401.12167","repositories_listed":0,"syntology":null},{"url":null,"slug":"vertical-federated-image-segmentation","title":"Vertical Federated Image Segmentation","date":"2024-01-15","arxiv_id":"2401.07931","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-road-to-on-board-change-detection-a","title":"The Road to On-board Change Detection: A Lightweight Patch-Level Change Detection Network via Exploring the Potential of Pruning and Pooling","date":"2023-10-16","arxiv_id":"2310.10166","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepadain-net-deep-adaptive-device-edge","title":"DeepAdaIn-Net: Deep Adaptive Device-Edge Collaborative Inference for Augmented Reality","date":"2023-09-22","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"in-defense-of-clip-based-video-relation","title":"In Defense of Clip-based Video Relation Detection","date":"2023-07-18","arxiv_id":"2307.08984","repositories_listed":0,"syntology":null},{"url":null,"slug":"end-to-end-learnable-multi-scale-feature","title":"End-to-End Learnable Multi-Scale Feature Compression for VCM","date":"2023-06-29","arxiv_id":"2306.16670","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-examples-detection-with-enhanced","title":"Adversarial Examples Detection with Enhanced Image Difference Features based on Local Histogram Equalization","date":"2023-05-08","arxiv_id":"2305.04436","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-and-effective-communication-for","title":"Semantic and Effective Communication for Remote Control Tasks with Dynamic Feature Compression","date":"2023-01-14","arxiv_id":"2301.05901","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-based-feature-compression-for-cnn","title":"Attention-based Feature Compression for CNN Inference Offloading in Edge Computing","date":"2022-11-24","arxiv_id":"2211.13745","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-modal-compression-towards-human","title":"Cross Modal Compression: Towards Human-comprehensible Semantic Compression","date":"2022-09-06","arxiv_id":"2209.02574","repositories_listed":0,"syntology":null},{"url":"/paper/complementary-bi-directional-feature","slug":"complementary-bi-directional-feature","title":"Complementary Bi-directional Feature Compression for Indoor 360° Semantic Segmentation with Self-distillation","date":"2022-07-06","arxiv_id":"2207.02437","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-compression-for-rate-constrained","title":"Feature Compression for Rate Constrained Object Detection on the Edge","date":"2022-04-15","arxiv_id":"2204.07314","repositories_listed":0,"syntology":null},{"url":null,"slug":"source-feature-compression-for-object","title":"Source Feature Compression for Object Classification in Vision-Based Underwater Robotics","date":"2021-12-28","arxiv_id":"2112.13953","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-compression-and-faster-inference","title":"Reconstructing Pruned Filters using Cheap Spatial Transformations","date":"2021-10-25","arxiv_id":"2110.12844","repositories_listed":0,"syntology":null},{"url":null,"slug":"video-coding-for-machine-compact-visual","title":"Video Coding for Machine: Compact Visual Representation Compression for Intelligent Collaborative Analytics","date":"2021-10-18","arxiv_id":"2110.09241","repositories_listed":0,"syntology":null},{"url":null,"slug":"memory-efficient-cnn-accelerator-based-on","title":"Memory-Efficient CNN Accelerator Based on Interlayer Feature Map Compression","date":"2021-10-12","arxiv_id":"2110.06155","repositories_listed":0,"syntology":null},{"url":null,"slug":"haar-wavelet-feature-compression-for","title":"Haar Wavelet Feature Compression for Quantized Graph Convolutional Networks","date":"2021-10-10","arxiv_id":"2110.04824","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-computation-efficient-device","title":"Communication-Computation Efficient Device-Edge Co-Inference via AutoML","date":"2021-08-30","arxiv_id":"2108.13009","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-for-wireless-2","title":"Deep Reinforcement Learning for Wireless Resource Allocation Using Buffer State Information","date":"2021-08-27","arxiv_id":"2108.12198","repositories_listed":0,"syntology":null},{"url":null,"slug":"fusion-towards-automated-icd-coding-via","title":"Fusion: Towards Automated ICD Coding via Feature Compression","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learnable-compression-network-with","title":"Connecting Compression Spaces with Transformer for Approximate Nearest Neighbor Search","date":"2021-07-30","arxiv_id":"2107.14415","repositories_listed":0,"syntology":null},{"url":null,"slug":"mitigating-severe-over-parameterization-in","title":"Mitigating severe over-parameterization in deep convolutional neural networks through forced feature abstraction and compression with an entropy-based heuristic","date":"2021-06-27","arxiv_id":"2106.14190","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisit-visual-representation-in-analytics","title":"Revisit Visual Representation in Analytics Taxonomy: A Compression Perspective","date":"2021-06-16","arxiv_id":"2106.08512","repositories_listed":0,"syntology":null},{"url":null,"slug":"selective-feature-compression-for-efficient","title":"Selective Feature Compression for Efficient Activity Recognition Inference","date":"2021-04-01","arxiv_id":"2104.00179","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-autonomous-driving-scenarios","title":"Large Scale Autonomous Driving Scenarios Clustering with Self-supervised Feature Extraction","date":"2021-03-30","arxiv_id":"2103.16101","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-intelligence-challenges-and","title":"Collaborative Intelligence: Challenges and Opportunities","date":"2021-02-13","arxiv_id":"2102.06841","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-submodular-maximization","title":"Dynamic Submodular Maximization","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pidnet-an-efficient-network-for-dynamic","title":"PIDNet: An Efficient Network for Dynamic Pedestrian Intrusion Detection","date":"2020-09-01","arxiv_id":"2009.00312","repositories_listed":0,"syntology":null},{"url":null,"slug":"derivation-of-information-theoretically","title":"Derivation of Information-Theoretically Optimal Adversarial Attacks with Applications to Robust Machine Learning","date":"2020-07-28","arxiv_id":"2007.14042","repositories_listed":0,"syntology":null},{"url":null,"slug":"chromatic-learning-for-sparse-datasets","title":"Chromatic Learning for Sparse Datasets","date":"2020-06-06","arxiv_id":"2006.03779","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-joint-transmission-recognition-for-power","title":"Joint Device-Edge Inference over Wireless Links with Pruning","date":"2020-03-04","arxiv_id":"2003.02027","repositories_listed":0,"syntology":null},{"url":null,"slug":"end-to-end-facial-deep-learning-feature","title":"End-to-End Facial Deep Learning Feature Compression with Teacher-Student Enhancement","date":"2020-02-10","arxiv_id":"2002.03627","repositories_listed":0,"syntology":null},{"url":null,"slug":"video-coding-for-machines-a-paradigm-of","title":"Video Coding for Machines: A Paradigm of Collaborative Compression and Intelligent Analytics","date":"2020-01-10","arxiv_id":"2001.03569","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-emerging-coding-paradigm-vcm-a-scalable","title":"An Emerging Coding Paradigm VCM: A Scalable Coding Approach Beyond Feature and Signal","date":"2020-01-09","arxiv_id":"2001.03004","repositories_listed":0,"syntology":null},{"url":null,"slug":"190511381","title":"Trust but Verify: An Information-Theoretic Explanation for the Adversarial Fragility of Machine Learning Systems, and a General Defense against Adversarial Attacks","date":"2019-05-25","arxiv_id":"1905.11381","repositories_listed":0,"syntology":null},{"url":null,"slug":"categorical-feature-compression-via","title":"Categorical Feature Compression via Submodular Optimization","date":"2019-04-30","arxiv_id":"1904.13389","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparing-of-term-clustering-frameworks-for","title":"Comparing of Term Clustering Frameworks for Modular Ontology Learning","date":"2019-01-25","arxiv_id":"1901.09037","repositories_listed":0,"syntology":null},{"url":null,"slug":"intermediate-deep-feature-compression-the","title":"Intermediate Deep Feature Compression: the Next Battlefield of Intelligent Sensing","date":"2018-09-17","arxiv_id":"1809.06196","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-lossless-deep-feature-compression-for","title":"Near-Lossless Deep Feature Compression for Collaborative Intelligence","date":"2018-04-26","arxiv_id":"1804.09963","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-feature-compression-for-collaborative","title":"Deep feature compression for collaborative object detection","date":"2018-02-12","arxiv_id":"1802.03931","repositories_listed":0,"syntology":null},{"url":"/paper/pixel-level-matching-for-video-object","slug":"pixel-level-matching-for-video-object","title":"Pixel-Level Matching for Video Object Segmentation using Convolutional Neural Networks","date":"2017-08-17","arxiv_id":"1708.05137","repositories_listed":0,"syntology":null},{"url":null,"slug":"compact-representation-for-image","title":"Compact Representation for Image Classification: To Choose or to Compress?","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":7,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":7,"papers_where_code_ran_first_page":"/task/feature-compression/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/feature-compression/papers/ran/1","json":"/task/feature-compression/papers/ran/1.json","rows":7}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"e2f7231a07a32c2ab12c3a56b6f89671898da7cd2a1b381371db65acd311f022","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}