Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

1122 · Oct 202519922001200920172026
17 results for G-smoothings

Imitation Learning describes the problem of recovering an expert policy from demonstrations. While inverse reinforcement learning approaches are known to be very sample-efficient in terms of expert demonstrations, they usually require problem-dependent reward functions or a (task-)specific reward-function regularizatio…

2019-06-19abs ↗pdf ↗

Study on braid monodromy of Lefschetz fibrations, proving infinite index subgroup.

problem Understanding the structure of braid monodromy in Lefschetz fibrations.
method Developed methods to show infinite index of subgroup, relating to character varieties.
result Proved infinite index subgroup for various cases of Lefschetz fibrations.

New algorithms reduce regret in online convex optimization with heavy-tailed gradients.

problem Challenges in online convex optimization with heavy-tailed gradients.
method Examined and analyzed old algorithms for online convex optimization in the heavy-tailed setting.
result Established new regret bounds for classical methods without algorithmic modification.

Deep neural networks are often trained in the over-parametrized regime (i.e. with far more parameters than training examples), and understanding why the training converges to solutions that generalize remains an open problem. Several studies have highlighted the fact that the training procedure, i.e. mini-batch Stochas…

2018-03-22abs ↗pdf ↗

Post-processing predictors reduces calibration errors for decision-making.

problem Predictors with low calibration error for machine learning may have high error for decision-making.
method Post-processing with ε distance to calibration adds noise to make predictions differentially private.
result Post-processing achieves O(√ε) ECE and CDL, asymptotically optimal.

BMM algorithm improves convergence for nonconvex optimization problems.

problem Constrained nonsmooth nonconvex optimization problems.
method Block majorization-minimization with diminishing radius.
result Improved convergence rate for nonconvex optimization problems.

Epoch-GDA achieves optimal convergence rate for SCSC min-max problems.

problem Solving stochastic min-max problems with strong convexity and strong concavity.
method Epoch-wise stochastic gradient descent ascent method (Epoch-GDA) without additional assumptions.
result Achieves the optimal rate of O(1/T)O(1/T) for the duality gap of general SCSC min-max problems.

Deep neural networks perform poorly on smooth functions despite strong approximation theory.

problem The gap between deep learning theory and practical performance on smooth functions.
method Computational framework to study DNN performance, comparing against best-in-class methods.
result There is a crucial gap between DNN approximation theory and practical performance, but it can be closed.