Fast, Parallel, Query-Efficient Binary Classification | Paper Citation Record

Observation 46d5a913-22a8-4467-beb3-e4fdc0d11a76 · outbound

This paper cites More asymmetry yields faster matrix multiplication.

Fast, Parallel, Query-Efficient Binary Classification More asymmetry yields faster matrix multiplication

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f61b7b6a-029e-41b4-b53a-696432834c8e · outbound

This paper cites Stochastic bias- reduced gradient methods.Advances in Neural Information Processing Systems, 34:10810–10822, 2021.

Fast, Parallel, Query-Efficient Binary Classification Stochastic bias- reduced gradient methods.Advances in Neural Information Processing Systems, 34:10810–10822, 2021

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98146fa2-e7e1-48d0-b0eb-cf94e07ad1e3 · outbound

This paper cites Stochastic bias- reduced gradient methods.

Fast, Parallel, Query-Efficient Binary Classification Stochastic bias- reduced gradient methods

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4be3dbd8-f7fb-4f88-b8e2-eef24cf5d8ee · outbound

This paper cites A cutting plane algorithm for convex programming that uses analytic centers.Mathematical Programming, 69(1-3):1–43, 1995.

Fast, Parallel, Query-Efficient Binary Classification A cutting plane algorithm for convex programming that uses analytic centers.Mathematical Programming, 69(1-3):1–43, 1995

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e5fd083-9b41-4e43-9188-a190140b0b41 · outbound

This paper cites Self-concordant analysis for logistic regression.Electronic Journal of Statistics, 4:384–414, 2010.

Fast, Parallel, Query-Efficient Binary Classification Self-concordant analysis for logistic regression.Electronic Journal of Statistics, 4:384–414, 2010

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 53215491-7c28-49fc-82e0-902fc9ae046f · outbound

This paper cites Mirror descent and nonlinear projected subgradient methods for convex optimization.Operations Research Letters, 31(3):167–175, 2003.

Fast, Parallel, Query-Efficient Binary Classification Mirror descent and nonlinear projected subgradient methods for convex optimization.Operations Research Letters, 31(3):167–175, 2003

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e9889177-d6cd-4e06-862e-1d494224a399 · outbound

This paper cites Curran Associates Inc., Red Hook, NY, USA, 2019.

Fast, Parallel, Query-Efficient Binary Classification Curran Associates Inc., Red Hook, NY, USA, 2019

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7233d868-2674-4f74-8061-3df513099f96 · outbound

This paper cites Distributionally Robust Optimization via Ball Oracle Acceleration.

Fast, Parallel, Query-Efficient Binary Classification Distributionally Robust Optimization via Ball Oracle Acceleration

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 69ccea7b-27e8-4b15-b7c9-4186e9523844 · outbound

This paper cites Variance reduction for matrix games.

Fast, Parallel, Query-Efficient Binary Classification Variance reduction for matrix games

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 59f39002-5f48-4dbe-b54f-5c8532e1cae9 · outbound

This paper cites Acceleration with a ball optimization oracle.

Fast, Parallel, Query-Efficient Binary Classification Acceleration with a ball optimization oracle

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 46a35de2-34b1-4f8d-a405-f218176fdf8e · outbound

This paper cites Coordinate methods for matrix games.

Fast, Parallel, Query-Efficient Binary Classification Coordinate methods for matrix games

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c2734c81-66d0-4de8-aad5-8e48a17f7660 · outbound

This paper cites Thinking inside the ball: Near-optimal minimization of the maximal loss.

Fast, Parallel, Query-Efficient Binary Classification Thinking inside the ball: Near-optimal minimization of the maximal loss

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 06cd865a-6e8b-4854-a381-4f3008f888c0 · outbound

This paper cites Optimal and adaptive monteiro-svaiter acceleration.

Fast, Parallel, Query-Efficient Binary Classification Optimal and adaptive monteiro-svaiter acceleration

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d54ac781-f6e4-43b3-8499-74c7d042bfee · outbound

This paper cites Resqueing parallel and private stochastic convex optimization.

Fast, Parallel, Query-Efficient Binary Classification Resqueing parallel and private stochastic convex optimization

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1cdb4f31-6695-4039-96cf-d508d869e879 · outbound

This paper cites A whole new ball game: A primal accelerated method for matrix games and minimizing the maximum of smooth functions.

Fast, Parallel, Query-Efficient Binary Classification A whole new ball game: A primal accelerated method for matrix games and minimizing the maximum of smooth functions

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a6bfd56e-32ed-4829-bd2e-8f8bf93322b8 · outbound

This paper cites Extracting Dual Solutions via Primal Optimizers.

Fast, Parallel, Query-Efficient Binary Classification Extracting Dual Solutions via Primal Optimizers

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 63e62678-b50d-49a1-afae-0a208567b94a · outbound

This paper cites Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity.

Fast, Parallel, Query-Efficient Binary Classification Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49d73cad-0568-4bb6-8376-99120b541e13 · outbound

This paper cites Optimal em- bedding dimension for sparse subspace embeddings.

Fast, Parallel, Query-Efficient Binary Classification Optimal em- bedding dimension for sparse subspace embeddings

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56006c40-2c7f-4e4c-97e7-2a18628f0047 · outbound

This paper cites Low-rank approximation and regression in input sparsity time.Journal of the ACM (JACM), 63(6):1–45, 2017.

Fast, Parallel, Query-Efficient Binary Classification Low-rank approximation and regression in input sparsity time.Journal of the ACM (JACM), 63(6):1–45, 2017

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce3eaff9-7b67-4bfe-a1f8-718570b38de5 · outbound

This paper cites Sublinear optimization for machine learning.

Fast, Parallel, Query-Efficient Binary Classification Sublinear optimization for machine learning

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f51bffae-6d6d-43ca-a6a2-fe7a8fc4040f · outbound

This paper cites Nearly tight oblivious subspace embeddings by trace inequalities.

Fast, Parallel, Query-Efficient Binary Classification Nearly tight oblivious subspace embeddings by trace inequalities

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4f8d5dc-8505-4521-b39d-3a10ed73d5d8 · outbound

This paper cites Optimal approximate matrix product in terms of stable rank.

Fast, Parallel, Query-Efficient Binary Classification Optimal approximate matrix product in terms of stable rank

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2c84cd1c-4723-4c4d-bcca-025cb5c808b1 · outbound

This paper cites Solving directed laplacian systems in nearly-linear time through sparse lu factorizations.

Fast, Parallel, Query-Efficient Binary Classification Solving directed laplacian systems in nearly-linear time through sparse lu factorizations

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 448aa743-3bd0-4cff-82d7-e10d9659b962 · outbound

This paper cites Solving linear programs in the current matrix multiplication time.Journal of the ACM (JACM), 68(1):1–39, 2021.

Fast, Parallel, Query-Efficient Binary Classification Solving linear programs in the current matrix multiplication time.Journal of the ACM (JACM), 68(1):1–39, 2021

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 16582044-3321-4561-96e0-dd3fed520e2d · outbound

This paper cites Conn, Nicholas I.

Fast, Parallel, Query-Efficient Binary Classification Conn, Nicholas I

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6efbe688-a184-4f8f-b3a9-1c668549ab0b · outbound

This paper cites Approaching optimality for solving dense linear systems with low-rank structure.

Fast, Parallel, Query-Efficient Binary Classification Approaching optimality for solving dense linear systems with low-rank structure

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 43cf05bd-a656-4da5-be3c-350ea18ec41a · outbound

This paper cites Faster linear systems and matrix norm approximation via multi-level sketched preconditioning.

Fast, Parallel, Query-Efficient Binary Classification Faster linear systems and matrix norm approximation via multi-level sketched preconditioning

Reference 27

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b9eb5279-52da-4e98-8c3e-83cd41641e22 · outbound

This paper cites Minimizing quasi-self-concordant functions by gradient regularization of newton method, 2023.

Fast, Parallel, Query-Efficient Binary Classification Minimizing quasi-self-concordant functions by gradient regularization of newton method, 2023

Reference 28

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 120f35e0-1151-4a2c-b12c-fa2fd8be5d85 · outbound

This paper cites Randomized smoothing for stochastic optimization.SIAM Journal on Optimization, 22(2):674–701, 2012.

Fast, Parallel, Query-Efficient Binary Classification Randomized smoothing for stochastic optimization.SIAM Journal on Optimization, 22(2):674–701, 2012

Reference 29

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4acdc231-6fee-4fe7-a2e6-bbb0fa3dfa9e · outbound

This paper cites Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization.

Fast, Parallel, Query-Efficient Binary Classification Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization

Reference 30

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e0ef66aa-bc88-4afe-b5ab-d238e557a3fc · outbound

This paper cites The convergence of inexact chebyshev and richardson iterative methods for solving linear systems.Numerische Mathematik, 53(5):571–593, 1988.

Fast, Parallel, Query-Efficient Binary Classification The convergence of inexact chebyshev and richardson iterative methods for solving linear systems.Numerische Mathematik, 53(5):571–593, 1988

Reference 31

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aaddd103-da9d-4629-8232-5df1b2d84be9 · outbound

This paper cites an unresolved cited work.

Fast, Parallel, Query-Efficient Binary Classification Unresolved cited work

Reference 32

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f68d6156-abf1-4ddf-9cb6-e1b6112e8187 · outbound

This paper cites A sublinear-time randomized approximation algorithm for matrix games.

Fast, Parallel, Query-Efficient Binary Classification A sublinear-time randomized approximation algorithm for matrix games

Reference 33

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d766655d-5387-487a-85c8-8ba6c72cf7b1 · outbound

This paper cites Liu, and Aaron Sidford.

Fast, Parallel, Query-Efficient Binary Classification Liu, and Aaron Sidford

Reference 34

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 218a873c-b608-4e09-baf9-0d5187597f54 · outbound

This paper cites Closing the computational-query depth gap in parallel stochastic convex optimization.

Fast, Parallel, Query-Efficient Binary Classification Closing the computational-query depth gap in parallel stochastic convex optimization

Reference 35

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 529e92f5-df12-46d2-a539-0ac52734502e · outbound

This paper cites Closing the computational-query depth gap in parallel stochastic convex optimization.

Fast, Parallel, Query-Efficient Binary Classification Closing the computational-query depth gap in parallel stochastic convex optimization

Reference 36

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4c38bcf1-5066-4516-be66-81b109428907 · outbound

This paper cites An improved cutting plane method for convex optimization, convex-concave games, and its applications.

Fast, Parallel, Query-Efficient Binary Classification An improved cutting plane method for convex optimization, convex-concave games, and its applications

Reference 37

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02876337-bef9-4c8c-98db-a8d5d15bf89f · outbound

This paper cites Reusing samples in variance reduction.

Fast, Parallel, Query-Efficient Binary Classification Reusing samples in variance reduction

Reference 38

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8448545c-ffa0-400a-b2fd-7dc9f7bb0d65 · outbound

This paper cites Accelerating stochastic gradient descent using predictive variance reduction.Advances in neural information processing systems, 26, 2013.

Fast, Parallel, Query-Efficient Binary Classification Accelerating stochastic gradient descent using predictive variance reduction.Advances in neural information processing systems, 26, 2013

Reference 39

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ca777e1f-2dd9-4c03-a569-4e2510559cef · outbound

This paper cites Global linear convergence of Newton's method without strong-convexity or Lipschitz gradients.

Fast, Parallel, Query-Efficient Binary Classification Global linear convergence of Newton's method without strong-convexity or Lipschitz gradients

Reference 40

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1259ee9-0e73-4736-86f0-f22bd650cea1 · outbound

This paper cites Solving zero-sum games with fewer matrix-vector products.

Fast, Parallel, Query-Efficient Binary Classification Solving zero-sum games with fewer matrix-vector products

Reference 41

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d16873bd-3978-449a-a453-89cb5c971346 · outbound

This paper cites Solving matrix games with near-optimal matvec complexity.58th Annual ACM Symposium on Theory of Computing (STOC), pages arXiv–2601, 2026.

Fast, Parallel, Query-Efficient Binary Classification Solving matrix games with near-optimal matvec complexity.58th Annual ACM Symposium on Theory of Computing (STOC), pages arXiv–2601, 2026

Reference 42

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 24e2f766-1390-40e5-9a6f-5a539aa31c12 · outbound

This paper cites The oracle complexity of simplex-based matrix games: Linear separability and nash equilibria.

Fast, Parallel, Query-Efficient Binary Classification The oracle complexity of simplex-based matrix games: Linear separability and nash equilibria

Reference 43

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9eb5edd2-db41-4d13-8928-430f2215f3a5 · outbound

This paper cites The oracle complexity of simplex-based matrix games: Linear separability and nash equilibria.

Fast, Parallel, Query-Efficient Binary Classification The oracle complexity of simplex-based matrix games: Linear separability and nash equilibria

Reference 44

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 33335280-37aa-4af9-bbbd-d6e9cd12b5b4 · outbound

This paper cites A faster cutting plane method and its implications for combinatorial and convex optimization.

Fast, Parallel, Query-Efficient Binary Classification A faster cutting plane method and its implications for combinatorial and convex optimization

Reference 45

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bde1c4fe-e935-4c90-832a-f6e8137d9a71 · outbound

This paper cites A universal catalyst for first-order optimiza- tion.Advances in neural information processing systems, 28, 2015.

Fast, Parallel, Query-Efficient Binary Classification A universal catalyst for first-order optimiza- tion.Advances in neural information processing systems, 28, 2015

Reference 46

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ad05e4e-06aa-4a3e-8a5a-42dda1e2aee4 · outbound

This paper cites A logical calculus of the ideas immanent in nervous activity.

Fast, Parallel, Query-Efficient Binary Classification A logical calculus of the ideas immanent in nervous activity

Reference 47

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f5c7e0a8-9a9d-4774-b4f3-cb3004b6626a · outbound

This paper cites Kernel-based svm.

Fast, Parallel, Query-Efficient Binary Classification Kernel-based svm

Reference 48

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cca7df0b-4a0e-49a5-b1e8-73486563457e · outbound

This paper cites Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings.

Fast, Parallel, Query-Efficient Binary Classification Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings

Reference 49

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c38eee6-7290-4037-80fe-3547c99ff070 · outbound

This paper cites On parallel complexity of nonsmooth convex optimization.Journal of Complexity, 10(4):451–463, 1994.

Fast, Parallel, Query-Efficient Binary Classification On parallel complexity of nonsmooth convex optimization.Journal of Complexity, 10(4):451–463, 1994

Reference 50

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4c267d02-6b40-4400-9881-a965a2148232 · outbound

This paper cites Prox-method with rate of convergence o(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems.

Fast, Parallel, Query-Efficient Binary Classification Prox-method with rate of convergence o(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems

Reference 51

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f672c49c-066c-4ba1-b48e-c6198e9194e6 · outbound

This paper cites Problem complexity and method efficiency in optimization.

Fast, Parallel, Query-Efficient Binary Classification Problem complexity and method efficiency in optimization

Reference 52

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b0d5efe2-0b19-4318-9126-077a63a8e443 · outbound

This paper cites Smooth minimization of non-smooth functions.

Fast, Parallel, Query-Efficient Binary Classification Smooth minimization of non-smooth functions

Reference 53

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6e88438-bde7-4914-8a4b-b39c248f7b26 · outbound

This paper cites Dual extrapolation and its applications to solving variational inequalities and related problems.Mathematical Programming, 109(2):319–344, Mar 2007.

Fast, Parallel, Query-Efficient Binary Classification Dual extrapolation and its applications to solving variational inequalities and related problems.Mathematical Programming, 109(2):319–344, Mar 2007

Reference 54

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5a71f365-20cc-418b-bc2f-6b999daf66dd · outbound

This paper cites Stochastic variance reduction methods for saddle-point problems.

Fast, Parallel, Query-Efficient Binary Classification Stochastic variance reduction methods for saddle-point problems

Reference 55

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7d088d3a-bcc5-4f6f-b8bf-992252477c0a · outbound

This paper cites an unresolved cited work.

Fast, Parallel, Query-Efficient Binary Classification Unresolved cited work

Reference 56

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ab5ef228-ce3a-4aaf-a8b0-81d9fa43a9b5 · outbound

This paper cites Pan and John H.

Fast, Parallel, Query-Efficient Binary Classification Pan and John H

Reference 57

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3728011b-1163-499c-81d3-d30eac27ced7 · outbound

This paper cites Rakhlin and K.

Fast, Parallel, Query-Efficient Binary Classification Rakhlin and K

Reference 58

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ecbe3f70-668f-44bb-969a-2927d6cf79c6 · outbound

This paper cites The perceptron: a probabilistic model for information storage and organiza- tion in the brain.

Fast, Parallel, Query-Efficient Binary Classification The perceptron: a probabilistic model for information storage and organiza- tion in the brain

Reference 59

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d501129d-b335-4dc6-8f90-98752539f787 · outbound

This paper cites Improved approximation algorithms for large matrices via random projections.

Fast, Parallel, Query-Efficient Binary Classification Improved approximation algorithms for large matrices via random projections

Reference 60

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1880107e-55c7-43a9-9530-7b54306f72ce · outbound

This paper cites Quantum speedups for stochastic optimization.

Fast, Parallel, Query-Efficient Binary Classification Quantum speedups for stochastic optimization

Reference 61

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 760b7b77-1679-4a60-afea-6cfef5f575d2 · outbound

This paper cites Generalized self-concordant functions: a recipe for newton- type methods.Mathematical Programming, 178(1-2):145–213, 2019.

Fast, Parallel, Query-Efficient Binary Classification Generalized self-concordant functions: a recipe for newton- type methods.Mathematical Programming, 178(1-2):145–213, 2019

Reference 62

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8e0c569d-0ddc-4d4e-8c77-1b55b55fc1f9 · outbound

This paper cites an unresolved cited work.

Fast, Parallel, Query-Efficient Binary Classification Unresolved cited work

Reference 63

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bce2db1f-5eea-482d-83af-e6aa33373930 · outbound

This paper cites Minimum cost flows, mdps, and l1-regression in nearly linear time for dense instances.

Fast, Parallel, Query-Efficient Binary Classification Minimum cost flows, mdps, and l1-regression in nearly linear time for dense instances

Reference 64

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers