{"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":"/paper/trusting-svm-for-piecewise-linear-cnns","title":"Trusting SVM for Piecewise Linear CNNs","arxiv_id":"1611.02185","date":"2016-11-07","proceeding":null,"authors":["Leonard Berrada","Andrew Zisserman","M. Pawan Kumar"],"abstract":"We present a novel layerwise optimization algorithm for the learning\nobjective of Piecewise-Linear Convolutional Neural Networks (PL-CNNs), a large\nclass of convolutional neural networks. Specifically, PL-CNNs employ piecewise\nlinear non-linearities such as the commonly used ReLU and max-pool, and an SVM\nclassifier as the final layer. The key observation of our approach is that the\nproblem corresponding to the parameter estimation of a layer can be formulated\nas a difference-of-convex (DC) program, which happens to be a latent structured\nSVM. We optimize the DC program using the concave-convex procedure, which\nrequires us to iteratively solve a structured SVM problem. This allows to\ndesign an optimization algorithm with an optimal learning rate that does not\nrequire any tuning. Using the MNIST, CIFAR and ImageNet data sets, we show that\nour approach always improves over the state of the art variants of\nbackpropagation and scales to large data and large network settings.","url_abs":"http://arxiv.org/abs/1611.02185v5","url_pdf":"http://arxiv.org/pdf/1611.02185v5.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":"trusting-svm-for-piecewise-linear-cnns","repo_url":"https://github.com/oval-group/pl-cnn","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"trusting-svm-for-piecewise-linear-cnns","repo_url":"https://github.com/lukasruff/Deep-SVDD","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"parameter-estimation","task_name":"parameter estimation"}],"methods":[{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"svm","method_name":"SVM"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"oval-group/pl-cnn","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"lukasruff/Deep-SVDD","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"4c02ff4ae8e6be00df39e8537dca87da0357768340a6bebccb6b07cba7515125","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}