Paper Citation Record · LEDGER

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions

As of 9 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 3 inbound Pith citation observations for arXiv:2502.06443.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2502.06443 v2

Coverage vector

measured 53 of 53 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T15:34:16.775757Z

measured 56 of 56 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-07-12T18:26:05.728364Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-12T05:31:24.127049Z

Reference resolution

53 of 53 outbound references displayed

verified exact2
verified fuzzy35
unresolved16
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3413796e-a243-4d74-b9db-a1c7de98cf60 · outbound

This paper cites SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.640124Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 54a40a25-9e73-4387-8654-8b7482ae7cf0 · outbound

This paper cites The merged-staircase property: a necessary and nearly sufficient condition for sgd learning of sparse functions on two-layer neural networks.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions The merged-staircase property: a necessary and nearly sufficient condition for sgd learning of sparse functions on two-layer neural networks

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.627812Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 10d60919-e706-4f38-8963-1717eef1ba7f · outbound

This paper cites Provable advantage of curriculum learning on parity targets with mixed inputs.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Provable advantage of curriculum learning on parity targets with mixed inputs

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.615542Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation d891adcf-4063-4d6b-beea-bcf753a75f3a · outbound

This paper cites Repetita Iuvant: Data Repetition Allows SGD to Learn High-Dimensional Multi-Index Functions.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Repetita Iuvant: Data Repetition Allows SGD to Learn High-Dimensional Multi-Index Functions

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.569798Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6ea80aca-4b31-4ebc-99c1-ef9201ecda8d · outbound

This paper cites On the universality of deep learning.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions On the universality of deep learning

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.601804Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 16c83e81-ae2c-43c9-b4cb-f97ff89df101 · outbound

This paper cites Online stochastic gradient descent on non-convex losses from high-dimensional inference.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Online stochastic gradient descent on non-convex losses from high-dimensional inference

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.588213Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation df28bd48-c375-4ffe-97f9-7276990a1693 · outbound

This paper cites High-dimensional limit theorems for SGD : Effective dynamics and critical scaling.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions High-dimensional limit theorems for SGD : Effective dynamics and critical scaling

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.573284Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 2230fce1-742b-4d12-a5c6-8ffb0cd67864 · outbound

This paper cites On Learning Gaussian Multi-index Models with Gradient Flow.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions On Learning Gaussian Multi-index Models with Gradient Flow

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.586354Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d73e4deb-6fee-4ae9-b951-fc8f14de59b1 · outbound

This paper cites Learning single-index models with shallow neural networks.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Learning single-index models with shallow neural networks

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.559422Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation c68a95ba-b8f1-4912-96e8-abfb8f342c59 · outbound

This paper cites Id3 learns juntas for smoothed product distributions.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Id3 learns juntas for smoothed product distributions

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.545776Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 7f726ba0-ece0-4ead-a770-3acad5f9d011 · outbound

This paper cites Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.599535Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 75582ffb-1a54-4324-8d40-191e5adc18cd · outbound

This paper cites High-dimensional asymptotics of feature learning: How one gradient step improves the representation.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions High-dimensional asymptotics of feature learning: How one gradient step improves the representation

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.532171Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 5a9d4ad8-a5c0-4aa3-a899-4a2fae77dc92 · outbound

This paper cites Learning in the presence of low-dimensional structure: a spiked random matrix perspective.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Learning in the presence of low-dimensional structure: a spiked random matrix perspective

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.518573Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation d4f5879d-e842-4356-a0b7-77b7ec874038 · outbound

This paper cites Learning time-scales in two-layers neural networks.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Learning time-scales in two-layers neural networks

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.612659Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00ff46dd-da5f-4bc0-aa77-8f746c0d313e · outbound

This paper cites The Distribution of Values of Analytic Functions on Convex Bodies.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions The Distribution of Values of Analytic Functions on Convex Bodies

Reference 15

Resolution: verified exact; local_arxiv, observed 2026-08-08T15:34:17.080764Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 07956966-6f13-4bef-9684-209f0064e743 · outbound

This paper cites Learning narrow one-hidden-layer ReLU networks.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Learning narrow one-hidden-layer ReLU networks

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.495703Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation f37d323b-f737-477b-b7fb-6fbc2621d801 · outbound

This paper cites Learning Juntas under Markov Random Fields.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Learning Juntas under Markov Random Fields

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.625479Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8485b09d-721c-4b6c-b0b9-9ed1b35fb49a · outbound

This paper cites A mathematical model for curriculum learning for parities.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions A mathematical model for curriculum learning for parities

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.482272Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 01185546-a602-4cff-af0d-cf8f1ea75734 · outbound

This paper cites Distributional and L^q norm inequalities for polynomials over convex bodies in R^n.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Distributional and L^q norm inequalities for polynomials over convex bodies in R^n

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.468442Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation ac8ada27-9886-401a-8624-895ac76c6e22 · outbound

This paper cites Learning single-index models in G aussian space.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Learning single-index models in G aussian space

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.453559Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation a261ff52-bf6c-4edb-a572-9f73bdb300c6 · outbound

This paper cites How Two-Layer Neural Networks Learn, One (Giant) Step at a Time.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions How Two-Layer Neural Networks Learn, One (Giant) Step at a Time

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.642638Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d90ad22c-f32d-452d-bf5e-e0e762e937cd · outbound

This paper cites Neural networks can learn representations with gradient descent.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Neural networks can learn representations with gradient descent

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.439989Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 2695e3a6-a8e4-48a0-9c3c-f4d194ce5c8e · outbound

This paper cites Learning parities with neural networks.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Learning parities with neural networks

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.426636Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 905ce3da-a044-4fcc-b529-726afde5c623 · outbound

This paper cites Smoothing the landscape boosts the signal for SGD : Optimal sample complexity for learning single index models.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Smoothing the landscape boosts the signal for SGD : Optimal sample complexity for learning single index models

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.414177Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 3d49df39-c687-49e0-aa0c-051e576e32a8 · outbound

This paper cites Computational-statistical gaps in G aussian single-index models.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Computational-statistical gaps in G aussian single-index models

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.401375Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation ee8bc199-455b-4a47-835c-df4c2a974aed · outbound

This paper cites The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponents.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponents

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.663507Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6eab725f-eda3-4c43-8874-72275576eb62 · outbound

This paper cites an unresolved cited work.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Unresolved cited work

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.667821Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0cf070d6-52e8-42cb-9cdc-fe018b53435f · outbound

This paper cites Agnostic learning of a single neuron with gradient descent.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Agnostic learning of a single neuron with gradient descent

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.380025Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 2a94d408-05ea-43ea-a96e-528d186302e6 · outbound

This paper cites Superpolynomial lower bounds for learning one-layer neural networks using gradient descent.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Superpolynomial lower bounds for learning one-layer neural networks using gradient descent

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.367001Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 14e4a8c8-0b24-41c3-bbf0-04784e488cc6 · outbound

This paper cites Modeling the influence of data structure on learning in neural networks: The hidden manifold model.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Modeling the influence of data structure on learning in neural networks: The hidden manifold model

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.353552Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation d7219710-d2b4-403d-be77-1e150fc454e7 · outbound

This paper cites On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries

Reference 31

Resolution: verified exact; local_arxiv, observed 2026-08-08T15:34:17.020132Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation a906c605-35c1-4f03-b88f-f8e075149755 · outbound

This paper cites Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.689515Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1c4b4ba2-2629-4af5-b6d6-a7585ced4ab9 · outbound

This paper cites Moment-Matching Polynomials.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Moment-Matching Polynomials

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.693733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 07a6a7db-d15c-468b-a607-ff3fb2e6e790 · outbound

This paper cites Learning and smoothed analysis.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Learning and smoothed analysis

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.340479Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation ff7b3fda-ee11-457a-8c7f-ced04434b9ce · outbound

This paper cites Decision trees are PAC-learnable from most product distributions: a smoothed analysis.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Decision trees are PAC-learnable from most product distributions: a smoothed analysis

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.701205Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3d56de1-9fe4-4e5e-b1fa-b50bb635619e · outbound

This paper cites In\'egalit\'es isop\'erim\'etriques en analyse et probabilit\'es.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions In\'egalit\'es isop\'erim\'etriques en analyse et probabilit\'es

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.327070Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 048d95b9-6d3e-4161-a529-51d4dcb91ca0 · outbound

This paper cites Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.709105Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 938358ae-9035-4b93-82e8-9a8dfd13b6dd · outbound

This paper cites Gradient-based feature learning under structured data.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Gradient-based feature learning under structured data

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.313298Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation b5a2bf39-2c45-4581-9f20-7566c727d531 · outbound

This paper cites Quantifying the benefit of using differentiable learning over tangent kernels.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Quantifying the benefit of using differentiable learning over tangent kernels

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.298228Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation c09bdb26-4a94-4859-ac56-f7581795ecf3 · outbound

This paper cites Learning functions of k relevant variables.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Learning functions of k relevant variables

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.284387Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 1a756173-9421-42c6-8cb7-f1feddc0a282 · outbound

This paper cites Concentration inequalities under sub- G aussian and sub-exponential conditions.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Concentration inequalities under sub- G aussian and sub-exponential conditions

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.270756Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation b0e1cfe9-d2bf-4d28-8b35-c611a5bea50f · outbound

This paper cites Improved statistical and computational complexity of the mean-field L angevin dynamics under structured data.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Improved statistical and computational complexity of the mean-field L angevin dynamics under structured data

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.257092Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 3baf2ad4-39ab-4ae9-8714-7e929712ae70 · outbound

This paper cites Nazarov, M.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Nazarov, M

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.243310Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 1c431418-582c-4e8f-9f5b-9b163aa59e7f · outbound

This paper cites Analysis of Boolean Functions.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Analysis of Boolean Functions

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.737858Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 659b52ab-6a49-4803-993c-28fc5935c072 · outbound

This paper cites Distribution-specific hardness of learning neural networks.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Distribution-specific hardness of learning neural networks

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.221516Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 9e85e2f9-be02-4b90-91a1-5907b9b1a006 · outbound

This paper cites Understanding machine learning: From theory to algorithms.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Understanding machine learning: From theory to algorithms

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.746356Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3aa2e627-3c88-41d3-ad02-f3c7fe8f649f · outbound

This paper cites Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.199475Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation da7c7c31-73f0-497c-9602-dc602e4cdebd · outbound

This paper cites On the cryptographic hardness of learning single periodic neurons.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions On the cryptographic hardness of learning single periodic neurons

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.185624Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation b3580926-7514-4c0c-87f7-36a62cb99ca3 · outbound

This paper cites Fundamental limits of weak learnability in high-dimensional multi-index models.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Fundamental limits of weak learnability in high-dimensional multi-index models

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.758763Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35c627cf-c135-4abc-9339-488718355a1d · outbound

This paper cites Finding correlations in subquadratic time, with applications to learning parities and juntas.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Finding correlations in subquadratic time, with applications to learning parities and juntas

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-08T15:34:16.762720Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f488407b-4d6b-4e70-a5d9-42ca546aa736 · outbound

This paper cites Learning a single neuron for non-monotonic activation functions.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Learning a single neuron for non-monotonic activation functions

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.163944Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation b509c07e-1dd2-4af9-b201-fe406fa9287c · outbound

This paper cites Learning a single neuron with gradient methods.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions Learning a single neuron with gradient methods

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.151188Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 6a79dd2e-dad1-43f2-a6e0-01ab24b836db · outbound

This paper cites On single-index models beyond G aussian data.

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions On single-index models beyond G aussian data

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T15:34:17.137644Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Pith citing papers

Observation b29a5ca7-1e84-4455-b407-a4eee819984c · inbound

The Power of Power Law: Asymmetry Enables Compositional Reasoning cites this paper.

The Power of Power Law: Asymmetry Enables Compositional Reasoning Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions

Reference 13

Resolution: metadata mismatch; arxiv_id, observed 2026-05-11T19:31:08.363842Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 8ce4de0f-6d99-4261-b741-38c20ec46912 · inbound

The Power of Power Law: Asymmetry Enables Compositional Reasoning cites this paper.

The Power of Power Law: Asymmetry Enables Compositional Reasoning Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-12T18:26:05.728364Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d37d22a-bbd6-45a1-ab99-91479acc4f0b · inbound

The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently cites this paper.

The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions

Reference 158

Resolution: verified exact; arxiv_id, observed 2026-05-12T05:31:24.131423Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.