{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:H2DWP4HVB5A6ZLT7CD3NXYPEXG","short_pith_number":"pith:H2DWP4HV","schema_version":"1.0","canonical_sha256":"3e8767f0f50f41ecae7f10f6dbe1e4b982f2177377475264585b258b408a0c9f","source":{"kind":"arxiv","id":"1406.3166","version":2},"attestation_state":"computed","paper":{"title":"Generalization and Robustness of Batched Weighted Average Algorithm with V-geometrically Ergodic Markov Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Lam Si Tung Ho, Nguyen Viet Cuong, Vu Dinh","submitted_at":"2014-06-12T09:37:25Z","abstract_excerpt":"We analyze the generalization and robustness of the batched weighted average algorithm for V-geometrically ergodic Markov data. This algorithm is a good alternative to the empirical risk minimization algorithm when the latter suffers from overfitting or when optimizing the empirical risk is hard. For the generalization of the algorithm, we prove a PAC-style bound on the training sample size for the expected $L_1$-loss to converge to the optimal loss when training data are V-geometrically ergodic Markov chains. For the robustness, we show that if the training target variable's values contain bo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1406.3166","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-12T09:37:25Z","cross_cats_sorted":[],"title_canon_sha256":"bf36d88b548ac21dd0769737097aebae7eecb38b635dec1989973bbdad275724","abstract_canon_sha256":"6a9500e0f20cddd8b1ff1f6bc316bffb425377e8929d21717cccf2ae5ad8792b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:22.969251Z","signature_b64":"3gbqfatKxV6sw/LnfVGyCty8xtm2ns5qFVqmUWxAXJzwAtCvnK5mGZ3DHhd4+A9AiC66zTLOtqoTh28PZPhUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e8767f0f50f41ecae7f10f6dbe1e4b982f2177377475264585b258b408a0c9f","last_reissued_at":"2026-05-18T02:45:22.968812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:22.968812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalization and Robustness of Batched Weighted Average Algorithm with V-geometrically Ergodic Markov Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Lam Si Tung Ho, Nguyen Viet Cuong, Vu Dinh","submitted_at":"2014-06-12T09:37:25Z","abstract_excerpt":"We analyze the generalization and robustness of the batched weighted average algorithm for V-geometrically ergodic Markov data. This algorithm is a good alternative to the empirical risk minimization algorithm when the latter suffers from overfitting or when optimizing the empirical risk is hard. For the generalization of the algorithm, we prove a PAC-style bound on the training sample size for the expected $L_1$-loss to converge to the optimal loss when training data are V-geometrically ergodic Markov chains. For the robustness, we show that if the training target variable's values contain bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3166","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.3166","created_at":"2026-05-18T02:45:22.968879+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3166v2","created_at":"2026-05-18T02:45:22.968879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3166","created_at":"2026-05-18T02:45:22.968879+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2DWP4HVB5A6","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2DWP4HVB5A6ZLT7","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2DWP4HV","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H2DWP4HVB5A6ZLT7CD3NXYPEXG","json":"https://pith.science/pith/H2DWP4HVB5A6ZLT7CD3NXYPEXG.json","graph_json":"https://pith.science/api/pith-number/H2DWP4HVB5A6ZLT7CD3NXYPEXG/graph.json","events_json":"https://pith.science/api/pith-number/H2DWP4HVB5A6ZLT7CD3NXYPEXG/events.json","paper":"https://pith.science/paper/H2DWP4HV"},"agent_actions":{"view_html":"https://pith.science/pith/H2DWP4HVB5A6ZLT7CD3NXYPEXG","download_json":"https://pith.science/pith/H2DWP4HVB5A6ZLT7CD3NXYPEXG.json","view_paper":"https://pith.science/paper/H2DWP4HV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3166&json=true","fetch_graph":"https://pith.science/api/pith-number/H2DWP4HVB5A6ZLT7CD3NXYPEXG/graph.json","fetch_events":"https://pith.science/api/pith-number/H2DWP4HVB5A6ZLT7CD3NXYPEXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2DWP4HVB5A6ZLT7CD3NXYPEXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2DWP4HVB5A6ZLT7CD3NXYPEXG/action/storage_attestation","attest_author":"https://pith.science/pith/H2DWP4HVB5A6ZLT7CD3NXYPEXG/action/author_attestation","sign_citation":"https://pith.science/pith/H2DWP4HVB5A6ZLT7CD3NXYPEXG/action/citation_signature","submit_replication":"https://pith.science/pith/H2DWP4HVB5A6ZLT7CD3NXYPEXG/action/replication_record"}},"created_at":"2026-05-18T02:45:22.968879+00:00","updated_at":"2026-05-18T02:45:22.968879+00:00"}