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,695 papers · 148 categories

Trend · papers per month

1234 · Aug 202019922001200920172026
48 results for Cautious Lion

Distributed Lion optimizes large model training by reducing communication costs.

problem Training large AI models efficiently with reduced communication costs.
method Adapted Lion optimizer for distributed training, using binary or lower-precision vectors for communication.
result Distributed Lion achieves comparable performance to standard optimizers but with significantly reduced communication bandwidth.

LION generates high-quality 3D shapes using hierarchical latent diffusion models.

problem Creating high-quality 3D shapes for digital artists.
method Hierarchical Latent Point Diffusion Model (LION) with a global shape latent and point-structured latent space.
result LION achieves state-of-the-art generation performance on ShapeNet benchmarks.

This work uses Lasry-Lions envelopes to solve nonconvex optimization problems.

problem Nonconvex and nonsmooth terms in optimization problems.
method Develops a homotopy approach using Lasry-Lions envelopes to approximate and solve the original problem.
result The method can solve composite minimization problems and is more effective than classical alternatives in certain domains.

A technique identifies memoryless algorithms approximating memory-dependent optimization methods.

problem Understanding how memory in optimization algorithms affects loss and generalization.
method Introducing a general technique to replace past iterates with the current one and adding a correction term.
result Lion does not have the same implicit anti-regularization as AdamW, explaining its better generalization performance.

Two strategies extend multi-label chaining for imprecise probability estimates.

problem Handling imprecise probability estimates in multi-label classification.
method Adapting multi-label chaining to use convex sets of distributions (credal sets).
result Adapted approaches produce relevant cautiousness on hard-to-predict instances.

Most classifiers operate by selecting the maximum of an estimate of the conditional distribution p(yx)p(y|x) where xx stands for the features of the instance to be classified and yy denotes its label. This often results in a {\em hubristic bias}: overconfidence in the assignment of a definite label. Usually, the observa…

2018-05-24abs ↗pdf ↗

Confidential Guardian prevents model abstention from being used to discriminate.

problem Dishonest institutions can exploit machine learning model abstention to unfairly deny services.
method Confidential Guardian uses zero-knowledge proofs to verify model confidence and detect suppression.
result Confidential Guardian effectively prevents the misuse of cautious predictions.

SDF-Bayes finds safe drug combinations safely, balancing optimism and caution.

problem Finding safe drug combinations in clinical trials with multiple drugs and patient heterogeneity.
method SDF-Bayes uses Bayesian statistics to choose the most likely MTD while ensuring safety constraints.
result SDF-Bayes outperforms existing methods in both accuracy and safety for drug combination trials.

We consider two functions on Sp(g,R) with values in the cyclic group of order four {1,-1,i,-i}. One was defined by Lion and Vergne. The other is -i raised to the power given by an integer valued function defined by Masbaum and the author (initially on the mapping class group of a surface). We identify these functions w…

2013-08-05abs ↗pdf ↗

New algorithm reduces regret in asynchronous multiplayer bandits to constant or logarithmic levels.

problem Asynchronous multiplayer bandits in cognitive radio networks.
method Cautious Greedy algorithm with O(Tlog(T))\mathcal{O}(\sqrt{T\log(T)}) minimax regret.
result Cautious Greedy yields constant instance-dependent regret under certain conditions.

In this paper, we consider the generalized lambda constant and the existence of ground states of the generalized Perelman's W-functional from a variational formulation. One result is concerned with the estimation of the generalized λλ constant. The other results are about the existence of ground states of generalized …

2015-12-28abs ↗pdf ↗

Safe reinforcement learning with logical constraints for optimal policy synthesis.

problem Ensuring safety during reinforcement learning while maximizing goal satisfaction.
method Adaptive safe padding that synthesizes optimal control policies satisfying temporal logic formulas.
result The proposed method handles the trade-off between exploration and safety with theoretical guarantees.

Calls to arms to build interpretable models express a well-founded discomfort with machine learning. Should a software agent that does not even know what a loan is decide who qualifies for one? Indeed, we ought to be cautious about injecting machine learning (or anything else, for that matter) into applications where t…

2017-11-20abs ↗pdf ↗

The paper examines stability of Sobolev inequalities on manifolds with Ricci curvature bounds.

problem Stability of Sobolev inequalities on Riemannian manifolds with Ricci curvature lower bounds.
method Generalized Lions' concentration compactness and rigidity results of Sobolev inequalities on singular spaces.
result Almost extremal functions are close to extremal functions on the round sphere and Euclidean Sobolev inequality.

New optimization method combines gradient clipping and non-Euclidean smoothness.

problem Improving optimization in non-Euclidean spaces for machine learning.
method Hybrid of steepest descent and conditional gradient, incorporating weight decay.
result Achieves optimal convergence rate and demonstrates effectiveness in deep learning.

Mean field game theory studies the behavior of a large number of interacting individuals in a game theoretic setting and has received a lot of attention in the past decade (Lasry and Lions, Japanese journal of mathematics, 2007). In this work, we derive mean field game partial differential equation systems from determi…

2019-10-29abs ↗pdf ↗

Inspired by recent work of P.-L. Lions on conditional optimal control, we introduce a problem of optimal stopping under bounded rationality: the objective is the expected payoff at the time of stopping, conditioned on another event. For instance, an agent may care only about states where she is still alive at the time …

2019-01-17abs ↗pdf ↗

We prove some old and new isoperimetric inequalities with the best constant using the ABP method applied to an appropriate linear Neumann problem. More precisely, we obtain a new family of sharp isoperimetric inequalities with weights (also called densities) in open convex cones of Rn\mathbb{R}^n. Our result applies to…

2013-04-05abs ↗pdf ↗

The Prescriptive Canvas improves business outcomes by directly prescribing actions based on predictions.

problem Sub-optimal performance in business projects due to a two-step approach of prediction and decision-making.
method The Prescriptive Canvas methodology for framing and communicating actions directly based on predictions.
result Improves framing and communication across stakeholders for successful business impact.

Deep learning has become increasingly popular in both supervised and unsupervised machine learning thanks to its outstanding empirical performance. However, because of their intrinsic complexity, most deep learning methods are largely treated as black box tools with little interpretability. Even though recent attempts …

2018-09-04abs ↗pdf ↗

Charmer improves character-level adversarial attacks for language models.

problem Efficiency and effectiveness of character-level adversarial attacks for language models.
method Query-based adversarial attack method that maintains semantic similarity.
result Charmer achieves high attack success rate and similar adversarial examples.

This paper improves SAM by reformulating it as a bilevel optimization problem.

problem Improving Sharpness-Aware Minimization (SAM) for better performance.
method Reformulate SAM as a bilevel optimization problem using a 0-1 loss surrogate.
result BiSAM consistently results in improved performance compared to SAM and its variants.

FedLion improves Federated Learning by speeding up convergence and reducing communication costs.

problem Slow convergence and high communication costs in Federated Learning.
method Integrates Lion's adaptive approach into Federated Learning framework, using signed gradients.
result FedLion outperforms existing adaptive algorithms in convergence rate and communication efficiency.

New MCMC method estimates differential privacy from multiple MIAs without worst-case assumptions.

problem Bayesian estimation of differential privacy from membership inference attacks.
method Bayesian estimation via MCMC algorithm (MCMC-DP-Est).
result More cautious privacy analysis with joint estimation of MIA strengths and privacy parameter.

Novel approach uses ENN for UQ in gust predictions, reducing RMSE and improving confidence.

problem Reducing bias and uncertainty in wind gust predictions.
method Evidential Neural Network (ENN) with Explainable AI.
result 47% reduction in RMSE, 95% coverage of observed gusts at 179 out of 266 stations.