{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/simple-stochastic-and-online-gradient","title":"Simple Stochastic and Online Gradient DescentAlgorithms for Pairwise Learning","arxiv_id":"2111.12050","date":"2021-11-23","proceeding":null,"authors":["Zhenhuan Yang","Yunwen Lei","Puyu Wang","Tianbao Yang","Yiming Ying"],"abstract":"Pairwise learning refers to learning tasks where the loss function depends on a pair of instances. It instantiates many important machine learning tasks such as bipartite ranking and metric learning. A popular approach to handle streaming data in pairwise learning is an online gradient descent (OGD) algorithm, where one needs to pair the current instance with a buffering set of previous instances with a sufficiently large size and therefore suffers from a scalability issue. In this paper, we propose simple stochastic and online gradient descent methods for pairwise learning. A notable difference from the existing studies is that we only pair the current instance with the previous one in building a gradient direction, which is efficient in both the storage and computational complexity. We develop novel stability results, optimization, and generalization error bounds for both convex and nonconvex as well as both smooth and nonsmooth problems. We introduce novel techniques to decouple the dependency of models and the previous instance in both the optimization and generalization analysis. Our study resolves an open question on developing meaningful generalization bounds for OGD using a buffering set with a very small fixed size. We also extend our algorithms and stability analysis to develop differentially private SGD algorithms for pairwise learning which significantly improves the existing results.","url_abs":"https://arxiv.org/abs/2111.12050v1","url_pdf":"https://arxiv.org/pdf/2111.12050v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"simple-stochastic-and-online-gradient","repo_url":"https://github.com/zhenhuan-yang/simple-pairwise","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"generalization-bounds","task_name":"Generalization Bounds"},{"task_slug":"metric-learning","task_name":"Metric Learning"},{"task_slug":"open-question","task_name":"Open-Ended Question Answering"}],"methods":[{"method_slug":"sgd","method_name":"SGD"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2111.12050","atlas_url":"https://app.syntology.ai/?focus=2111.12050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12050"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/zhenhuan-yang/simple-pairwise","reach":null}],"summary":{"ran_fixture":1,"ran_honours":1},"by_repo_kind":{"official":{"samples":2,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":2,"samples":[{"code_sha256_prefix":"15ec384d12ed3ccc","entry":"auc_olp_1_hinge","repo":"zhenhuan-yang/simple-pairwise","repo_kind":"official","path":"alg/auc_olp_1_hinge.py","file_url":"https://github.com/zhenhuan-yang/simple-pairwise/blob/HEAD/alg/auc_olp_1_hinge.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"15ec384d12ed3ccc"}},{"code_sha256_prefix":"7f75b419fa227545","entry":"get_idx","repo":"zhenhuan-yang/simple-pairwise","repo_kind":"official","path":"alg/auc_olp_1_hinge.py","file_url":"https://github.com/zhenhuan-yang/simple-pairwise/blob/HEAD/alg/auc_olp_1_hinge.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"7f75b419fa227545"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}