Efficiently Factorizing Boolean Matrices using Proximal Gradient Descent
–Neural Information Processing Systems
This problem is often addressed using variants of matrix factorization, a family of methods that decompose the target matrix into a set of typically low-rank factor matrices whose product approximates the input well.
Neural Information Processing Systems
Nov-13-2025, 13:03:32 GMT
- Country:
- Asia
- Middle East > Israel
- Haifa District > Haifa (0.04)
- Singapore (0.04)
- Middle East > Israel
- Europe
- Bulgaria (0.04)
- North Macedonia > Skopje Statistical Region
- Skopje Municipality > Skopje (0.04)
- Sweden > Stockholm
- Stockholm (0.04)
- North America
- Canada
- Alberta > Census Division No. 6
- Calgary Metropolitan Region > Calgary (0.04)
- Nova Scotia > Halifax Regional Municipality
- Halifax (0.04)
- Quebec > Montreal (0.04)
- Alberta > Census Division No. 6
- United States
- California
- Los Angeles County > Long Beach (0.04)
- Monterey County > Pacific Grove (0.04)
- San Diego County > San Diego (0.04)
- Colorado > Denver County
- Denver (0.04)
- Florida > Miami-Dade County
- Miami (0.04)
- Nebraska > Douglas County
- Omaha (0.04)
- California
- Canada
- Oceania
- Australia > New South Wales
- Sydney (0.04)
- New Zealand > North Island
- Auckland Region > Auckland (0.04)
- Australia > New South Wales
- Asia
- Genre:
- Research Report (0.68)
- Industry:
- Health & Medicine
- Pharmaceuticals & Biotechnology (0.68)
- Therapeutic Area > Oncology (1.00)
- Information Technology (0.68)
- Health & Medicine
- Technology: