Papers › SeesawFaceNets: sparse and robust face verification model for mobile platform
SeesawFaceNets: sparse and robust face verification model for mobile platform
Jintao Zhang
Deep Convolutional Neural Network (DCNNs) come to be the most widely used solution for most computer vision related tasks, and one of the most important application scenes is face verification. Due to its high-accuracy performance, deep face verification models of which the inference stage occurs on cloud platform through internet plays the key role on most prectical scenes. However, two critical issues exist: First, individual privacy may not be well protected since they have to upload their personal photo and other private information to the online cloud backend. Secondly, either training or inference stage is time-comsuming and the latency may affect customer experience, especially when the internet link speed is not so stable or in remote areas where mobile reception is not so good, but also in cities where building and other construction may block mobile signals. Therefore, designing lightweight networks with low memory requirement and computational cost is one of the most practical solutions for face verification on mobile platform. In this paper, a novel mobile network named SeesawFaceNets, a simple but effective model, is proposed for productively deploying face recognition for mobile devices. Dense experimental results have shown that our proposed model SeesawFaceNets outperforms the baseline MobilefaceNets, with only {\bf66\%}(146M VS 221M MAdds) computational cost, smaller batch size and less training steps, and SeesawFaceNets achieve comparable performance with other SOTA model e.g. mobiface with only {\bf54.2\%}(1.3M VS 2.4M) parameters and {\bf31.6\%}(146M VS 462M MAdds) computational cost, It is also eventually competitive against large-scale deep-networks face recognition on all 5 listed public validation datasets, with {\bf6.5\%}(4.2M VS 65M) parameters and {\bf4.35\%}(526M VS 12G MAdds) computational cost.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1908.09124")
Code
Syntology Ran 7 of 17 code samples harvested from 3 repositories linked to this paper; 10 have no recorded run. Of those that ran: 1 ran · honoured contract; 4 ran · our draft was wrong; 2 ran with no contract checked.
By repository: community (archive-listed): 17 samples from 3 repositories, 7 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
17 samples harvested; 7 ran; 1 honoured the contract we drafted; 10 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 5 of the 17 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from 3 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
41b5161a608d5f29 · report
b71052fb86154367 · report
0db9f814cdec6488 · report
80d427a5f4557b3d · report
b7f364dbce963974 · report
8b5594729a056dad · report
b4e2f92e3ce5abc6 · report
6b0e6100d2ca104e · report
c4e1ca09fcca76fc · report
15396a0e5161d1a2 · report
d074710facc3ca20 · report
7068d53e5a1d27e7 · report
a88ec2b4b2ac122c · report
522ee6c31c17d845 · report
c2027475131174ef · report
1a075d92bb280328 · report
6661cdf22fccc11e · report
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Lightweight Face Recognition | AgeDB-30 | Seesaw-shuffleFaceNet(mobi) | Accuracy | 0.9648 | #2 of 5 | Archive leaderboard | report |
| Lightweight Face Recognition | AgeDB-30 | Seesaw-shuffleFaceNet(mobi) | MParams | 2.8 | #2 of 5 | Archive leaderboard | report |
| Lightweight Face Recognition | CFP-FP | Seesaw-shuffleFaceNet(mobi) | Accuracy | 0.9307 | #4 of 4 | Archive leaderboard | report |
| Lightweight Face Recognition | CFP-FP | Seesaw-shuffleFaceNet(mobi) | MParams | 2.8 | #4 of 4 | Archive leaderboard | report |
| Lightweight Face Recognition | LFW | Seesaw-shuffleFaceNet(mobi) | Accuracy | 0.9965 | #4 of 6 | Archive leaderboard | report |
| Lightweight Face Recognition | LFW | Seesaw-shuffleFaceNet(mobi) | MParams | 2.8 | #4 of 6 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections