[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-fine-tuning-and-rl-close-the-gap-in-domain-adaptation":10,"sections":35},{"siteName":4,"siteTagline":5,"publisherName":4,"contactEmail":6},"The Revision","Tech news, decoded.","editor@therevision.news",{"gaMeasurementId":8,"adsenseClientId":9},"G-ZW2MV82GYR","ca-pub-8533917693782264",{"article":11},{"id":12,"slug":13,"title":14,"dek":15,"body_md":16,"tags_json":17,"published_at":18,"created_at":19,"updated_at":20,"status":21,"review_note":22,"review_notes":23,"image_url":22,"persona_id":22,"persona_name":22,"section":24,"tags":25,"sources":30,"feedback":34,"feedback_at":22,"cost_usd":34,"total_tokens":34},3856,"fine-tuning-and-rl-close-the-gap-in-domain-adaptation","Fine-Tuning and RL Close the Gap in Domain Adaptation","A two-stage framework combining supervised fine-tuning and reinforcement learning improves adversarial robustness in unlabeled target domains by double digits.","A research paper proposes a new method for making AI classifiers hold up when the data they're tested on looks nothing like the data they trained on.\n\nThe framework, called SFT+RL, tackles a known weak spot in unsupervised domain adaptation: models that perform well on clean source data tend to fall apart when the target data has been adversarially perturbed. The approach runs in two stages. First, it adversarially fine-tunes a linear classifier on top of CLIP's visual encoder using a technique called PGD-based perturbation, partially unfreezing CLIP's projection layer to let the model adapt without losing its general visual understanding. Second, a reinforcement learning stage progressively assigns labels to unlabeled target samples, filtering them through a decaying confidence threshold to keep only the high-quality guesses before training on a mix of clean and adversarial examples.\n\nThe results are hard to dismiss: across three standard benchmark datasets — OfficeHome, PACS, and VisDA — SFT+RL averaged a 10.2% gain in clean accuracy and a 15.8% gain in adversarial robustness over existing methods. That kind of gap matters because real-world deployments rarely get clean, in-distribution data, and current approaches force an uncomfortable trade-off between the two.\n\nBuilding on CLIP rather than training from scratch is a sensible move, but it also means the method inherits whatever biases CLIP carries — a caveat the paper does not dwell on.","[\"machine learning\",\"adversarial robustness\",\"domain adaptation\",\"research\"]","2026-07-07T04:00:00.000Z","2026-07-07T10:09:47.136Z","2026-07-07T10:09:50.077Z","published",null,[],"ai",[26,27,28,29],"machine learning","adversarial robustness","domain adaptation","research",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2607.03600",0,{"sections":36},[37,41,46,51,56,61,66,71,76,80,85,89,94,99],{"name":38,"slug":24,"count":39,"latest_published_at":40},"AI",2590,"2026-07-16T04:00:00.000Z",{"name":42,"slug":43,"count":44,"latest_published_at":45},"Security","security",294,"2026-07-15T19:59:48.000Z",{"name":47,"slug":48,"count":49,"latest_published_at":50},"Deals","deals",179,"2026-06-29T20:02:07.000Z",{"name":52,"slug":53,"count":54,"latest_published_at":55},"Policy","policy",158,"2026-07-16T00:02:48.000Z",{"name":57,"slug":58,"count":59,"latest_published_at":60},"Hardware","hardware",122,"2026-07-14T19:46:26.000Z",{"name":62,"slug":63,"count":64,"latest_published_at":65},"Consumer Tech","consumer-tech",93,"2026-07-13T13:20:48.000Z",{"name":67,"slug":68,"count":69,"latest_published_at":70},"Software","software",70,"2026-07-13T19:52:25.000Z",{"name":72,"slug":73,"count":74,"latest_published_at":75},"Science","science",66,"2026-07-10T10:29:37.000Z",{"name":77,"slug":78,"count":79,"latest_published_at":18},"Dev Tools","dev-tools",59,{"name":81,"slug":82,"count":83,"latest_published_at":84},"Gaming","gaming",41,"2026-07-09T04:00:00.000Z",{"name":86,"slug":87,"count":83,"latest_published_at":88},"Startups","startups","2026-06-29T20:55:50.000Z",{"name":90,"slug":91,"count":92,"latest_published_at":93},"General","general",29,"2026-07-10T22:28:58.000Z",{"name":95,"slug":96,"count":97,"latest_published_at":98},"Reviews","reviews",20,"2026-06-24T12:00:01.000Z",{"name":100,"slug":101,"count":102,"latest_published_at":103},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]