Tootfinder

🇺🇦 #NowPlaying on KEXP's #AfternoonShow
D'Angelo:
🎵 Smooth
#DAngelo
https://hkmsyr42.bandcamp.com/track/dangelo-smooth-keesoul-keemix

I had this little avatar from years ago, originally borrowed from a series of Flash animations called "Ninjai - the little ninja".
It was way to small to be used for an avatar in its current size, so I asked Gemini to upscale it and give it a little more texture.
Mind blown!
#AI #GenAI

Unlike all electrode-based brain implants for restoring vision that can at best only convey a couple of rough edges at a time, The vOICe sensory substitution can also convey smooth shading and textures, completely noninvasively https://www.artificialvision.com/neuralink.htm

It's the little things in life.

How bonkers?
You can run DOOM on a 13 year old cable from Apple bonkers.
https://www.tomshardware.com/video-games/doom-runs-on-an-apple-lightning-to-hdmi-dongle-soc-inside-adapter-has-enough-power-for-smooth-gameplay

Eliminated Vikings aiming for smooth landing with McCarthy to finish turbulent season https://www.foxsports.com/articles/nfl/eliminated-vikings-aiming-for-smooth-landing-with-mccarthy-to-finish-turbulent-season…

Right tea break time - then we can start optimising the desktop and all the programs as well as moving over the files.
I guess that is where we will start to run into different problems.

This linux install is taking a lot longer than I'd hoped (which was probably unrealistic to be fair), but has been pretty smooth so far (once we left microsoft world at least)
14/n

Moody Urbanity - Manmade Confinements ⛑️
情绪化城市 - 人造禁锢 ⛑️
📷 Pentax MX
🎞️ Kentmere Pan 400
#filmphotography #Photography #blackandwhite

Although the upgrade from beta1 to beta2 was very smooth, I'm still learning on the availability of certain ports in various stages of beta-ism. Sometimes they are there and sometimes not yet?
But perhaps the whole backbone is changing, so a ports collection needs to be moved over as well.
So, all is there, except for river, wideriver and deluge.When you do a River spin the first two are quite essential 🥳 Patient is the careful adventurer.
Gotta say though that with zfs…

Next nice harvest will be gramichama. A small, subtropical tree with fruit that tastes just like cherries. And such pretty fruit! #fromthegarden #permaculture #retrosuburbia

New Classes of Non-monotone Variational Inequality Problems Solvable via Proximal Gradient on Smooth Gap Functions
Lei Zhao, Daoli Zhu, Shuzhong Zhang
https://arxiv.org/abs/2510.12105

New Classes of Non-monotone Variational Inequality Problems Solvable via Proximal Gradient on Smooth Gap Functions
In this paper, we study the local linear convergence behavior of proximal-gradient (PG) descent algorithm on a parameterized gap-function reformulation of a smooth but non-monotone variational inequality problem (VIP). The aim is to solve the non-monotone VI problem without assuming the existence of a Minty-type solution. We first introduce and study various error bound conditions for the gap functions in relation to the VI model. In particular, we show that uniform type error bounds imply leve…

On the Mather stability theorem for smooth maps
Rustam Sadykov
https://arxiv.org/abs/2510.10305 https://arxiv.org/pdf/2510.10305

On the Mather stability theorem for smooth maps
In [MaII] Mather proved that a smooth proper infinitesimally stable map is stable. This result is the key component of the Mather stability theorem [MaV], which can be reformulated as follows: a smooth proper map $f: M\to N$ is stable if and only if it is infinitesimally stable if and only if it satisfies the Mather normal crossing condition. The latter condition, roughly speaking, means that all map germs of $f$ are stable and $f$ maps the singular strata of $f$ to $N$ in a mutually transversa…

Smooth Spatiotemporal Tube Synthesis for Prescribed-Time Reach-Avoid-Stay Control
Siddhartha Upadhyay, Ratnangshu Das, Pushpak Jagtap
https://arxiv.org/abs/2510.11583 https://…

Smooth Spatiotemporal Tube Synthesis for Prescribed-Time Reach-Avoid-Stay Control
In this work, we address the issue of controller synthesis for a control-affine nonlinear system to meet prescribed time reach-avoid-stay specifications. Our goal is to improve upon previous methods based on spatiotemporal tubes (STTs) by eliminating the need for circumvent functions, which often lead to abrupt tube modifications and high control effort. We propose an adaptive framework that constructs smooth STTs around static unsafe sets, enabling continuous avoidance while guiding the system…

🇺🇦 #NowPlaying on KEXP's #MorningShow
Wings:
🎵 Let ’Em In
#Wings
https://phbrussels.bandcamp.com/track/wings-let-em-in-ph-sweet-smooth-old-pop-edit

learn 👇

Got a sunflower lanyard at #Dokk1. It's the international signal for invisible disabilities.
It wasn't as smooth as I hoped for. There was nobody at the info desk of borgerservice. Thankfully the people at the info desk of the library told me that I just need to stand there and someone will come. That worked and I got the lanyard without having to explain myself. That was nice.

Bigraded Lie algebras and nilpotent fundamental groups of smooth complex algebraic varieties
Taito Shimoji
https://arxiv.org/abs/2510.09026 https://arxiv.o…

Bigraded Lie algebras and nilpotent fundamental groups of smooth complex algebraic varieties
Let $X$ be a smooth complex algebraic variety. Assume that the fundamental group $π_1(X,x)$ is torsion-free nilpotent. We show that if the betti number $b_1(X)$ is less than or equal to $3$, then $π_1(X,x)$ is isomorphic to $\mathbb{Z}$, $\mathbb{Z}^2$, $\mathbb{Z}^3$, a lattice in the Heisenberg group $H_3(\mathbb{R})$ or $\mathbb{R}\times H_3(\mathbb{R})$. Moreover we show that $π_1(X,x)$ is abelian or $2$-step nilpotent if the rank of $π_1(X,x)$ is less than or equal to seven. We prove t…

So we tried #nextcloud talk yesterday with friends and it was AMAZING. I first struggled with sound in-out but that was clearly my setup with external speakers and external camera. (really not the typical setup!)
But the 2h video call went totally smooth, good quality, no lag.
If you do videocalls with friends and family.. I can totally recommend nextcloud call - in my case hosted…

🇺🇦 Auf radioeins läuft...
Nick Waterhouse:
🎵 Smooth Operator
#NowPlaying #NickWaterhouse
https://nickwaterhouse.bandcamp.com/track/smooth-operator
https://open.spotify.com/track/6tge4eFwEkFvzsNrNo1ddG

On the Ratat-Goormaghtigh equation and integer points close to the graph of a smooth function
Tomohiro Yamada
https://arxiv.org/abs/2510.11252 https://arxi…

On the Ratat-Goormaghtigh equation and integer points close to the graph of a smooth function
We prove that the sum of reciprocals $1/x$ of integer solutions of $(x^m-1)/(x-1)=N$ with $x, m\geq 2$ for a given integer $N$ except the smallest $x$ is smaller than $5.9037$. If we limit $x$ to be prime, then the sum is smaller than $0.73194$.

A silent scenery in four acts...
(Selenium-toned[1] 4x6 salt print (still in final wash) plus previous work-in-progress stages... see alt text for details)
The picture/motif itself is one of my personal favorites and was taken 4 years ago in the Alpstein massif, when clouds were spontaneously forming around us, creating a wonderful light/scene/drama and a dear memory... now also as print which likely will/can outlast myself
[1] The tones will become more neutral once dry...…

Next nice harvest will be gramichama. A small, subtropical tree with fruit that tastes just like cherries. And such pretty fruit! #fromthegarden #permaculture #retrosuburbia

Optimal Smooth Coverage Trajectory Planning for Quadrotors in Cluttered Environment
Duanjiao Li, Yun Chen, Ying Zhang, Junwen Yao, Dongyue Huang, Jianguo Zhang, Ning Ding
https://arxiv.org/abs/2510.03169

Optimal Smooth Coverage Trajectory Planning for Quadrotors in Cluttered Environment
For typical applications of UAVs in power grid scenarios, we construct the problem as planning UAV trajectories for coverage in cluttered environments. In this paper, we propose an optimal smooth coverage trajectory planning algorithm. The algorithm consists of two stages. In the front-end, a Genetic Algorithm (GA) is employed to solve the Traveling Salesman Problem (TSP) for Points of Interest (POIs), generating an initial sequence of optimized visiting points. In the back-end, the sequence is…

My penguin-powered PC is channeling the Force tonight! Streaming SWTOR and proving you don't need the Galactic Empire to achieve ultimate stability. Come see the smooth frames! #SWTOR #LinuxGaming #StarWars

Got to say a few words on "AI and Art" on the "Blaues Rauschen" Podcast. My main point: AI art will not only diminish what people using it can express but will also change people's acceptance of friction: If all you know if perfectly smooth slop, will you really accept anything but? Also: Decomputing.
https://

from my link log —
Notes on gamma correction.
https://poniesandlight.co.uk/reflect/gamma/
saved 2025-12-12 https://dotat.at/:/BAJDJ.…

Notes on Gamma
The nuance between seeing and perceiving, linearity and non-linearity, what EOTFs are – and how to draw nice smooth gradients against the odds

I did a two mile bike ride this morning on this old sküle fixed gear(?) cruiser which was all I felt like doing. Pedal was wonky, not a smooth ride. Nice to get out though… the place we are staying has a bunch of bikes for use.
#bikeTooter

Smooth Uncertainty Sets: Dependence of Uncertain Parameters via a Simple Polyhedral Set
Noam Goldberg, Michael Poss, Shimrit Shtern
https://arxiv.org/abs/2510.08843 https://

Smooth Uncertainty Sets: Dependence of Uncertain Parameters via a Simple Polyhedral Set
We propose a novel polyhedral uncertainty set for robust optimization, termed the smooth uncertainty set, which captures dependencies of uncertain parameters by constraining their pairwise differences. The bounds on these differences may be dictated by the underlying physics of the problem and may be expressed by domain experts. When correlations are available, the bounds can be set to ensure that the associated probabilistic constraints are satisfied for any given probability. We explore spe…

A smooth filament origin for distant prolate galaxies seen by JWST and HST: #DarkMatter in ways never before possible.

RIP Windows 10 🔨🪟
A great alternative is Windows 98, it installs pretty quickly and will run extremely smooth even on very cheap used hardware.

$h$-Principles for smooth curves and knots with prescribed curvature
Mohammad Ghomi, Matteo Raffaelli
https://arxiv.org/abs/2510.05275 https://arxiv.org/pd…

$h$-Principles for smooth curves and knots with prescribed curvature
We show that smooth curves with prescribed curvature satisfy a $C^1$-dense $h$-principle in the space of immersed curves in Euclidean space. More precisely, every $C^{α\geq 2}$ curve with nonvanishing curvature in $R^{n\geq 3}$ can be $C^1$-approximated by $C^α$ curves of any larger curvature, prescribed as a function of arclength. It follows that there exist $C^\infty$ knots of prescribed curvature in every isotopy class of closed curves embedded in $R^3$.

Non-linear stability of shock profiles in dissipative hyperbolic-hyperbolic systems
Matthias Sroczinski, Kevin Zumbrun
https://arxiv.org/abs/2510.09287 https://

Non-linear stability of shock profiles in dissipative hyperbolic-hyperbolic systems
We give the first proof of nonlinear stability for smooth shock profiles of second-order dissipative hyperbolic-hyperbolic systems under the assumption of spectral stability, showing stability of smooth small-amplitude profiles in dimensions greater than or equal to two. This class of systems notably includes the two types of causal viscous relativistic gas models introduced respectively by Freistühler-Temple and Bemfica-Disconzi-Noronha, and (the equivalent second-order form of) a class of fi…

A smooth Gaussian-Kronecker diffeomorphism
Mostapha Benhenda (LAGA)
https://arxiv.org/abs/2510.05672 https://arxiv.org/pdf/2510.05672

A smooth Gaussian-Kronecker diffeomorphism
We build a smooth Gaussian-Kronecker diffeomorphism, answering a question raised by Anatole Katok in his list of ''Five Most Resistant Problems in Dynamics''.

Aww man, heard the news too late that this is the final night of Pinball Pete's Ann Arbor in its current location. Hope the transition is smooth – excited to check out the new space when it opens up

Gaussian Ensemble Topology (GET): A New Explicit and Inherently Smooth Framework for Manufacture-Ready Topology Optimization
Xinyu Ma, Chengxin Wang, Meng Wang, Xu Guo, Liu Yang, Huajian Gao
https://arxiv.org/abs/2510.05572

Gaussian Ensemble Topology (GET): A New Explicit and Inherently Smooth Framework for Manufacture-Ready Topology Optimization
We introduce the Gaussian Ensemble Topology (GET) method, a new explicit and manufacture-ready framework for topology optimization in which design geometries are represented as superpositions of anisotropic Gaussian functions. By combining explicit Gaussian descriptions with a level-set-like Heaviside projection, GET inherently generates smooth, curvature-continuous designs without requiring post-processing steps such as mesh or corner smoothing and feature extraction. The method is validated o…

From Abelianization to Tangent Categories
Sacha Ikonicoff, Jean-Simon Pacaud Lemay, Tim Van der Linden
https://arxiv.org/abs/2510.12324 https://arxiv.org/p…

From Abelianization to Tangent Categories
A tangent category is a category with an endofunctor, called the tangent bundle functor, which is equipped with various natural transformations that capture essential properties of the classical tangent bundle of smooth manifolds. In this paper, we show that, surprisingly, the category of groups is a tangent category whose tangent bundle functor is induced by abelianization and whose differential bundles correspond to abelian groups. We generalize this construction by introducing the concept of…

FLOWING: Implicit Neural Flows for Structure-Preserving Morphing
Arthur Bizzi, Matias Grynberg, Vitor Matias, Daniel Perazzo, Jo\~ao Paulo Lima, Luiz Velho, Nuno Gon\c{c}alves, Jo\~ao Pereira, Guilherme Schardong, Tiago Novello
https://arxiv.org/abs/2510.09537

FLOWING: Implicit Neural Flows for Structure-Preserving Morphing
Morphing is a long-standing problem in vision and computer graphics, requiring a time-dependent warping for feature alignment and a blending for smooth interpolation. Recently, multilayer perceptrons (MLPs) have been explored as implicit neural representations (INRs) for modeling such deformations, due to their meshlessness and differentiability; however, extracting coherent and accurate morphings from standard MLPs typically relies on costly regularizations, which often lead to unstable traini…

Smooth functions which are Morse on preimages of values not being local extrema and constructing natural functions of the class on connected sums of manifolds admitting these functions
Naoki Kitazawa
https://arxiv.org/abs/2510.00464

Smooth functions which are Morse on preimages of values not being local extrema and constructing natural functions of the class on connected sums of manifolds admitting these functions
We discuss smooth functions which are Morse on preimages of values not being local extrema. We call such a function internally Morse or I-Morse. The Reeb graph of a smooth function is the space of all connected components of preimages of single points of it topologized with the natural quotient topology of the manifolds and a vertex of it is a point corresponding to a preimage with critical points. A smooth function is neat with respect to the Reeb graph or N-Reeb if the preimages of the vert…

Since Massabesic Lake is the water supply for Manchester, NH it's one of very few lakes in Southern NH which isn't crammed with ticky-tacky houses; a trail leads from the road to a point where you're surrounded by water on three sides
#photo #photography

Efficient Group Lasso Regularized Rank Regression with Data-Driven Parameter Determination
Meixia Lin, Meijiao Shi, Yunhai Xiao, Qian Zhang
https://arxiv.org/abs/2510.11546 http…

Efficient Group Lasso Regularized Rank Regression with Data-Driven Parameter Determination
High-dimensional regression often suffers from heavy-tailed noise and outliers, which can severely undermine the reliability of least-squares based methods. To improve robustness, we adopt a non-smooth Wilcoxon score based rank objective and incorporate structured group sparsity regularization, a natural generalization of the lasso, yielding a group lasso regularized rank regression method. By extending the tuning-free parameter selection scheme originally developed for the lasso, we introduce …

The #AgaveSpike that started last April is getting a bit sad at the base now. However it has a cousin that has just started to shoot up its own spike. #Photography #FlowersOfMastodon

Classification for smooth manifolds looking like $\mathbb{CP}^3\times S^7$
Wen Shen
https://arxiv.org/abs/2510.00613 https://arxiv.org/pdf/2510.00613

Classification for smooth manifolds looking like $\mathbb{CP}^3\times S^7$
In this paper, we classify simply connected closed smooth $13$-dimensional manifolds whose cohomology ring is isomorphic to that of $\mb{CP}^3\times S^7$, up to diffeomorphism, homeomorphism, and homotopy equivalence. Furthermore, if such a manifold satisfies certain conditions, either itself or its connected sum with an exotic $13$-sphere $Σ^{13}$ admits a Riemannian metric of non-negative sectional curvature. As an additional application of our classification, we classify the diagonal $S^1$-…

Smooth measures and positive continuous additive functionals attached to a compact nest
Takumu Ooi, Kaneharu Tsuchida, Toshihiro Uemura
https://arxiv.org/abs/2509.23060 https://…

Smooth measures and positive continuous additive functionals attached to a compact nest
The relationship between smooth measures and positive continuous additive functionals is well known, and this correspondence is called the Revuz correspondence. We investigate the relationships between several types of convergence of smooth measures and convergence of positive continuous additive functionals, mainly focusing on a treatment of nests. We provide conditions under which convergence of additive functionals implies convergence of the corresponding smooth measures. Our results cover c…

MODE: Learning compositional representations of complex systems with Mixtures Of Dynamical Experts
Nathan Quiblier, Roy Friedman, Matthew Ricci
https://arxiv.org/abs/2510.09594 …

MODE: Learning compositional representations of complex systems with Mixtures Of Dynamical Experts
Dynamical systems in the life sciences are often composed of complex mixtures of overlapping behavioral regimes. Cellular subpopulations may shift from cycling to equilibrium dynamics or branch towards different developmental fates. The transitions between these regimes can appear noisy and irregular, posing a serious challenge to traditional, flow-based modeling techniques which assume locally smooth dynamics. To address this challenge, we propose MODE (Mixture Of Dynamical Experts), a graphic…

Sometimes it feels like nothing I do is good enough to overcome the biases I face.
No one tells you that the glass ceiling is covered in shards of sharp glass spikes rather than getting mashed against a smooth glass surface.
I worked so hard to create a better world for the people around me that I almost forgot that no one was creating a better world for me.

JWST and Keck Observations of the Off-Nuclear TDE AT 2024tvd: A Massive Nuclear Star Cluster and Minor-Merger Origin for its Black Hole
Kishore C. Patra, Ryan J. Foley, Nicholas Earl, Kyle W. Davis, Enrico Ramirez-Ruiz, V. Ashley Villar, Sebastian Gomez, K. Decker French, Kirsty Taggart, Prasiddha Arunachalam, Phillip Macias, Ravjit Kaur, Samaporn Tinyanont
htt…

JWST and Keck Observations of the Off-Nuclear TDE AT 2024tvd: A Massive Nuclear Star Cluster and Minor-Merger Origin for its Black Hole
We present JWST/NIRSpec and NIRCam observations of the first optically selected off-nuclear tidal disruption event (TDE), AT 2024tvd, along with Keck/KCWI integral field unit spectroscopy. The spectra show broad H and He emission lines that are characteristic of a TDE. Stellar kinematics show smooth host-galaxy morphology and ordered bulge rotation, with no evidence of disturbances in velocity, dispersion, age or metallicity space. We construct the first quasi-simultaneous spectral-energy distr…

Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices
Pravesh K. Kothari, Jeff Xu
https://arxiv.org/abs/2510.03061 https://arxiv.org/pdf/25…

Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices
In this work, we revisit algorithms for Tensor PCA: given an order-$r$ tensor of the form $T = G+λ\cdot v^{\otimes r}$ where $G$ is a random symmetric Gaussian tensor with unit variance entries and $v$ is an unknown boolean vector in $\{\pm 1\}^n$, what's the minimum $λ$ at which one can distinguish $T$ from a random Gaussian tensor and more generally, recover $v$? As a result of a long line of work, we know that for any $\ell \in \N$, there is a $n^{O(\ell)}$ time algorithm that succeeds whe…

On $\alpha$-monotone operators and their resolvent in Banach spaces
Changchi Huang, Jigen Peng, Yuchao Tang
https://arxiv.org/abs/2510.12538 https://arxiv.…

On $α$-monotone operators and their resolvent in Banach spaces
This paper introduces a new definition of $α$-monotone operators in real 2-uniformly convex and smooth Banach spaces. Based on this new definition, we establish several novel structural and analytical properties of such operators, which not only extend classical results from Hilbert spaces but also reveal new insights into the geometry of Banach spaces. In particular, we examine the resolvent of $α$-maximal monotone operators and demonstrate how its behavior is consistent with, and generalize…

so smooth from 61 🧈 | 📺#WASvsDAL on FOX 📲- Stream on NFL #DallasCowboys #BrandonAubrey #shorts …

For #MusicWomenWednesday this week, I'm not usually into very chill, very nice music, but this new EP 'Moments' by London's Noé Solange is very much that. Love her voice and the production and everything. Four very smooth, shimmering songs.

🇺🇦 #NowPlaying on #BBC6Music's #FocusBeats
Pete Rock:
🎵 Smooth Sailing
#PeteRock
https://chopperman.bandcamp.com/track/pete-rock-smooth-sailing
https://open.spotify.com/track/3EXte8UYaO7o9R5vHYVDjv

Here's a photo that's a bit different from my usual style.
I took it with the tele lens on last weekend's hike. The inversion caused such a great sea of clouds with just some sole islands.
This kind of weather really offers such unique motives. And again: it was worth carrying the zoom lens up there :-D
Enjoy!
#photography

Sample-Efficient and Smooth Cross-Entropy Method Model Predictive Control Using Deterministic Samples
Markus Walker, Daniel Frisch, Uwe D. Hanebeck
https://arxiv.org/abs/2510.05706

Sample-Efficient and Smooth Cross-Entropy Method Model Predictive Control Using Deterministic Samples
Cross-entropy method model predictive control (CEM--MPC) is a powerful gradient-free technique for nonlinear optimal control, but its performance is often limited by the reliance on random sampling. This conventional approach can lead to inefficient exploration of the solution space and non-smooth control inputs, requiring a large number of samples to achieve satisfactory results. To address these limitations, we propose deterministic sampling CEM (dsCEM), a novel framework that replaces the ra…

🇺🇦 #NowPlaying on KEXP's #VarietyMix
Sailor Jane:
🎵 Smooth Operator
#SailorJane
https://sailorjane.bandcamp.com/track/smooth-operator
https://open.spotify.com/track/33xY8ZwJfeWhSW5AnUAhWv

Formal smoothness of the Artin-Mazur formal groups
Livia Grammatica
https://arxiv.org/abs/2510.03001 https://arxiv.org/pdf/2510.03001

Formal smoothness of the Artin-Mazur formal groups
Let $X$ be a smooth proper variety over an algebraically closed field of positive characteristic $p$. We find cohomological conditions for the Artin-Mazur formal group functors $Φ^{i}(X,\mathbb{G}_m)$ to be formally smooth. We show that if all crystalline cohomology groups of $X$ are torsion-free (e.g. if $X$ is an abelian variety) then all of the $Φ^{i}(X,\mathbb{G}_m)$ are representable and formally smooth. We then identify a necessary condition for formal smoothness, which we use to give e…

🇺🇦 Auf radioeins läuft...
Pete Rock & CL Smooth:
🎵 They Reminisce Over You (Single Version)
#NowPlaying #PeteRock #CLSmooth
https://alteredtapes.bandcamp.com/track/pete-rock-cl-smooth-they-reminisce-over-you-altered-tapes-rework
https://open.spotify.com/track/70HR1M0sDqCZQ7UJ2xAvvr

On the cardinality of measures of maximal relative entropy for smooth skew products
Matheus M. Castro, Gary Froyland
https://arxiv.org/abs/2510.04475 https://

On the cardinality of measures of maximal relative entropy for smooth skew products
Let $Ω$ and $M$ be compact smooth manifolds and let $Θ:Ω\times M\toΩ\times M$ be a $\mathcal C^{1+α}$ skew-product diffeomorphism over an Axiom A base. We show that $Θ$ has at most countably many ergodic hyperbolic measures of maximal relative entropy. When $\dim M=2$, if $Θ$ has positive relative topological entropy, then $Θ$ has at most countably many ergodic measures of maximal relative entropy.

Estimating Sequences with Memory for Minimizing Convex Non-smooth Composite Functions
Endrit Dosti, Sergiy A. Vorobyov, Themistoklis Charalambous
https://arxiv.org/abs/2510.02965

Estimating Sequences with Memory for Minimizing Convex Non-smooth Composite Functions
First-order optimization methods are crucial for solving large-scale data processing problems, particularly those involving convex non-smooth composite objectives. For such problems with convex non-smooth composite objectives, we introduce a new class of generalized composite estimating sequences, devised by exploiting the information embedded in the iterates generated during the minimization process. Building on these sequences, we propose a novel accelerated first-order method tailored for su…

The Rational Homotopy of Stable $C_p$-Smoothings
Oliver H. Wang
https://arxiv.org/abs/2510.11622 https://arxiv.org/pdf/2510.11622

The Rational Homotopy of Stable $C_p$-Smoothings
Smooth structures on high dimensional manifolds are classified by maps to the infinite loop space $TOP/O$. The homotopy groups of this space are known to be finite. Given a compact Lie group $G$, this space can be regarded as an equivariant infinite loop space and equivariant maps from a locally linear, high dimensional $G$-manifold to $TOP/O$ classify stable $G$-smoothings. We compute the equivariant homotopy groups $π_V^{C_p}TOP/O\otimes\Q$ where $C_p$ denotes the cyclic group of order $p$.

Metropolitana V 🍎
城 V 🍎
📷 Pentax MX
🎞️ Ilford Pan 100
#filmphotography #Photography #blackandwhite

Just WD40-ed all the joints and screws in my old cranky & creeky tripod... and oh my, everything's sooper smooth again... 🤌

On the $v$-adic values of G-functions II
Georgios Papas
https://arxiv.org/abs/2510.11814 https://arxiv.org/pdf/2510.11814

On the $v$-adic values of G-functions II
This is the second in a series of papers by the author centered around the study of values of G-functions associated to $1$-parameter families of abelian varieties $f:\CX\rightarrow S$ and a point $s_0\in S(K)$ with smooth fiber over some number field $K$. Here we study the case where $f:\CX\rightarrow S$ is a family of elliptic curves. We construct relations among the values of G-functions in this setting at points whose fiber is a CM elliptic curve. These lead to bounds for the height of su…

Obstacle Avoidance using Dynamic Movement Primitives and Reinforcement Learning
Dominik Urbaniak, Alejandro Agostini, Pol Ramon, Jan Rosell, Ra\'ul Su\'arez, Michael Suppa
https://arxiv.org/abs/2510.09254

Obstacle Avoidance using Dynamic Movement Primitives and Reinforcement Learning
Learning-based motion planning can quickly generate near-optimal trajectories. However, it often requires either large training datasets or costly collection of human demonstrations. This work proposes an alternative approach that quickly generates smooth, near-optimal collision-free 3D Cartesian trajectories from a single artificial demonstration. The demonstration is encoded as a Dynamic Movement Primitive (DMP) and iteratively reshaped using policy-based reinforcement learning to create a di…

Uncertainty-Based Smooth Policy Regularisation for Reinforcement Learning with Few Demonstrations
Yujie Zhu, Charles A. Hepburn, Matthew Thorpe, Giovanni Montana
https://arxiv.org/abs/2509.15981

Uncertainty-Based Smooth Policy Regularisation for Reinforcement Learning with Few Demonstrations
In reinforcement learning with sparse rewards, demonstrations can accelerate learning, but determining when to imitate them remains challenging. We propose Smooth Policy Regularisation from Demonstrations (SPReD), a framework that addresses the fundamental question: when should an agent imitate a demonstration versus follow its own policy? SPReD uses ensemble methods to explicitly model Q-value distributions for both demonstration and policy actions, quantifying uncertainty for comparisons. We …

Time to harness the sun! ☀️🛰️
We are LIVE for today's 3D printing stream, and we're adding more solar arrays to the Tiangong space station model. Powering the space race, one layer at a time (and still running smooth on Linux, naturally 🐧).
Tune in to watch the model grow: 👇 https://www.twitch.tv/tuxramus

Sequential Convex Programming for 6-DoF Powered Descent Guidance with Continuous-Time Compound State-Triggered Constraints
Samet Uzun, Behcet Acikmese, John M. Carson III
https://arxiv.org/abs/2510.09610

Sequential Convex Programming for 6-DoF Powered Descent Guidance with Continuous-Time Compound State-Triggered Constraints
This paper presents a sequential convex programming (SCP) framework for ensuring the continuous-time satisfaction of compound state-triggered constraints, a subset of logical specifications, in the powered descent guidance (PDG) problem. The proposed framework combines the generalized mean-based smooth robustness measure (D-GMSR), a parameterization technique tailored for expressing discrete-time temporal and logical specifications through smooth functions, with the continuous-time successive c…

MultiCOIN: Multi-Modal COntrollable Video INbetweening
Maham Tanveer, Yang Zhou, Simon Niklaus, Ali Mahdavi Amiri, Hao Zhang, Krishna Kumar Singh, Nanxuan Zhao
https://arxiv.org/abs/2510.08561

MultiCOIN: Multi-Modal COntrollable Video INbetweening
Video inbetweening creates smooth and natural transitions between two image frames, making it an indispensable tool for video editing and long-form video synthesis. Existing works in this domain are unable to generate large, complex, or intricate motions. In particular, they cannot accommodate the versatility of user intents and generally lack fine control over the details of intermediate frames, leading to misalignment with the creative mind. To fill these gaps, we introduce \modelname{}, a vi…

Antiampleness and ampleness of the Frobenius cokernel
Devlin Mallory
https://arxiv.org/abs/2510.03193 https://arxiv.org/pdf/2510.03193

Antiampleness and ampleness of the Frobenius cokernel
We show that if $X$ is a smooth Fano variety containing a line or a conic with respect to $-K_X$, then the Frobenius cokernel $\mathcal B_X:=\mathrm{coker}(\mathcal O_X\to F_* \mathcal O_X)$ is not antiample; using this criteria, we show that the only smooth Fano threefolds with antiample Frobenius cokernel are $\mathbb P^3$ and the quadric threefold (in characteristic $p\neq 2$), thus answering a question raised by Carvajal-Rojas and Patakfalvi. We also show that for any smooth complete inters…

I would add that IME robot vacuum cleaners are a bit of a gimmick, they're good at hard smooth floors but rubbish with rugs and you can't do under the sofa cushions, dust bookshelves or deal with cobwebs hanging from the ceiling. In many ways they add to housework rather than reducing it.

Metric Sobolev spaces II: dual energies and divergence measures
Luigi Ambrosio, Toni Ikonen, Danka Lu\v{c}i\'c, Enrico Pasqualetto
https://arxiv.org/abs/2510.12424 https://

Metric Sobolev spaces II: dual energies and divergence measures
This is the second of two works concerning the Sobolev calculus on metric measure spaces and its applications. In this work, we focus on several approaches to vector calculus in the non-smooth setting of complete and separable metric spaces equipped with a boundedly-finite Borel measure. More precisely, we study different notions of (co)vector fields and derivations appearing in the literature, as well as their mutual relation. We also carry forward a thorough investigation of gradients, diverg…

On the Profile of Singularity Formation for the Incompressible Hydrostatic Boussinesq system
Slim Ibrahim, Quyuan Lin, Lingjun Qian, Edriss S. Titi
https://arxiv.org/abs/2510.10090

On the Profile of Singularity Formation for the Incompressible Hydrostatic Boussinesq system
The primitive equations (PEs) model planetary large-scale oceanic and atmospheric dynamics. While it has been shown that there are smooth solutions to the inviscid PEs (also called the hydrostatic Euler equations) with constant temperature (isothermal) that develop stable singularities in finite time, the effect of non-constant temperature on the singularity formation has not been established yet. This paper studies the stability of singularity formation for non-constant temperature in two scen…

Minimizing smooth Kurdyka-{\L}ojasiewicz functions via generalized descent methods: Convergence rate and complexity
Masoud Ahookhosh, Susan Ghaderi, Alireza Kabgani, Morteza Rahimi
https://arxiv.org/abs/2511.10414 https://arxiv.org/pdf/2511.10414 https://arxiv.org/html/2511.10414
arXiv:2511.10414v1 Announce Type: new
Abstract: This paper addresses the generalized descent algorithm (DEAL) for minimizing smooth functions, which is analyzed under the Kurdyka-{\L}ojasiewicz (KL) inequality. In particular, the suggested algorithm guarantees a sufficient decrease by adapting to the cost function's geometry. We leverage the KL property to establish the global convergence, convergence rates, and complexity. A particular focus is placed on the linear convergence of generalized descent methods. We show that the constant step-size and Armijo line search strategies along a generalized descent direction satisfy our generalized descent condition. Additionally, for nonsmooth functions by leveraging the smoothing techniques such as forward-backward and high-order Moreau envelopes, we show that the boosted proximal gradient method (BPGA) and the boosted high-order proximal-point (BPPA) methods are also specific cases of DEAL, respectively. It is notable that if the order of the high-order proximal term is chosen in a certain way (depending on the KL exponent), then the sequence generated by BPPA converges linearly for an arbitrary KL exponent. Our preliminary numerical experiments on inverse problems and LASSO demonstrate the efficiency of the proposed methods, validating our theoretical findings.
toXiv_bot_toot

🇺🇦 #NowPlaying on KEXP's #VarietyMix
Sade:
🎵 Smooth Operator
#Sade
https://yulianiko.bandcamp.com/track/sade-smooth-operator-yulia-niko-edit
https://open.spotify.com/track/7pLuEMFougkSHXrPBtNxTR

Crosslisted article(s) found for cs.CE. https://arxiv.org/list/cs.CE/new
[1/1]:
- Smooth Uncertainty Sets: Dependence of Uncertain Parameters via a Simple Polyhedral Set
Noam Goldberg, Michael Poss, Shimrit Shtern

🇺🇦 #NowPlaying on #BBC6Music's #FocusBeats
Pete Rock:
🎵 Smooth Sailing
#PeteRock
https://chopperman.bandcamp.com/track/pete-rock-smooth-sailing
https://open.spotify.com/track/3EXte8UYaO7o9R5vHYVDjv

Furstenberg systems of certain sequences of superpolynomial growth
Andreu Ferr\'e Moragues, Andreas Koutsogiannis
https://arxiv.org/abs/2510.11957 https://

Furstenberg systems of certain sequences of superpolynomial growth
We give examples of sequences defined by smooth functions of intermediate growth, and we study the Furstenberg systems that model their statistical behavior. In particular, we show that the systems are Bernoulli. We do so by studying exponential sums that reflect the strong equidistribution properties of said sequences. As a by-product of our approach, we also get some convergence results.

dHPR: A Distributed Halpern Peaceman--Rachford Method for Non-smooth Distributed Optimization Problems
Zhangcheng Feng, Defeng Sun, Yancheng Yuan, Guojun Zhang
https://arxiv.org/abs/2511.10069 https://arxiv.org/pdf/2511.10069 https://arxiv.org/html/2511.10069
arXiv:2511.10069v1 Announce Type: new
Abstract: This paper introduces the distributed Halpern Peaceman--Rachford (dHPR) method, an efficient algorithm for solving distributed convex composite optimization problems with non-smooth objectives, which achieves a non-ergodic $O(1/k)$ iteration complexity regarding Karush--Kuhn--Tucker residual. By leveraging the symmetric Gauss--Seidel decomposition, the dHPR effectively decouples the linear operators in the objective functions and consensus constraints while maintaining parallelizability and avoiding additional large proximal terms, leading to a decentralized implementation with provably fast convergence. The superior performance of dHPR is demonstrated through comprehensive numerical experiments on distributed LASSO, group LASSO, and $L_1$-regularized logistic regression problems.
toXiv_bot_toot

Smooth hyperbolicity cones are second-order cone representable
Claus Scheiderer
https://arxiv.org/abs/2509.17121 https://arxiv.org/pdf/2509.17121

Smooth hyperbolicity cones are second-order cone representable
Netzer and Sanyal proved that every smooth hyperbolicity cone is a spectrahedral shadow. We generalize and sharpen this result at the same time, by showing that every Nash-smooth hyperbolicity cone is even second-order cone representable (socr). The result is proved as a consequence of another theorem, according to which every compact convex semialgebraic set is socr, provided that its boundary is Nash-smooth of strict positive curvature. The proof uses the technique of tensor evaluation.

Crosslisted article(s) found for math.AT. https://arxiv.org/list/math.AT/new
[1/1]:
- Bigraded Lie algebras and nilpotent fundamental groups of smooth complex algebraic varieties
Taito Shimoji

Large smooth twins from short lattice vectors
Erik Mulder (GRACE), Bruno Sterner (GRACE), Wessel van Woerden
https://arxiv.org/abs/2509.17699 https://arxiv…

Large smooth twins from short lattice vectors
Finding the largest pair of consecutive $B$-smooth integers is computationally challenging. Current algorithms to find such pairs have an exponential runtime -- which has only be provably done for $B \leq 100$ and heuristically for $100 < B \leq 113$. We improve this by detailing a new algorithm to find such large pairs. The core idea is to solve the shortest vector problem (SVP) in a well constructed lattice. With this we are able to significantly increase $B$ and notably report the heuristica…

Kontinuous Kontext: Continuous Strength Control for Instruction-based Image Editing
Rishubh Parihar, Or Patashnik, Daniil Ostashev, R. Venkatesh Babu, Daniel Cohen-Or, Kuan-Chieh Wang
https://arxiv.org/abs/2510.08532

Kontinuous Kontext: Continuous Strength Control for Instruction-based Image Editing
Instruction-based image editing offers a powerful and intuitive way to manipulate images through natural language. Yet, relying solely on text instructions limits fine-grained control over the extent of edits. We introduce Kontinuous Kontext, an instruction-driven editing model that provides a new dimension of control over edit strength, enabling users to adjust edits gradually from no change to a fully realized result in a smooth and continuous manner. Kontinuous Kontext extends a state-of-the…

Computing Control Lyapunov-Barrier Functions: Softmax Relaxation and Smooth Patching with Formal Guarantees
Jun Liu, Maxwell Fitzsimmons
https://arxiv.org/abs/2510.02223 https:/…

Computing Control Lyapunov-Barrier Functions: Softmax Relaxation and Smooth Patching with Formal Guarantees
We present a computational framework for synthesizing a single smooth Lyapunov function that certifies both asymptotic stability and safety. We show that the existence of a strictly compatible pair of control barrier and control Lyapunov functions (CBF-CLF) guarantees the existence of such a function on the exact safe set certified by the barrier. To maximize the certifiable safe domain while retaining differentiability, we employ a log-sum-exp (softmax) relaxation of the nonsmooth maximum barr…

🇺🇦 #NowPlaying on KEXP's #AfternoonShow
Sade:
🎵 Smooth Operator
#Sade
https://yulianiko.bandcamp.com/track/sade-smooth-operator-yulia-niko-edit
https://open.spotify.com/track/7pLuEMFougkSHXrPBtNxTR

Continuous Linear Series
Eduardo Esteves, Antonio Nigro, Pedro Rizzo
https://arxiv.org/abs/2510.11623 https://arxiv.org/pdf/2510.11623

Continuous Linear Series
We parameterize by a fine moduli space all degenerations of linear series to a singular curve which is the union of two smooth components meeting transversally at a single point. For this we introduce a novel object in the study of degenerations of linear series, which is the continuous linear series. Our moduli space can be regarded as a Hilbert quotient, in the terminology introduced by Kapranov, and is a new compactification of Osserman moduli space of exact limit linear series, and conseque…

Composite Optimization with Error Feedback: the Dual Averaging Approach
Yuan Gao, Anton Rodomanov, Jeremy Rack, Sebastian Stich
https://arxiv.org/abs/2510.03507 https://

Composite Optimization with Error Feedback: the Dual Averaging Approach
Communication efficiency is a central challenge in distributed machine learning training, and message compression is a widely used solution. However, standard Error Feedback (EF) methods (Seide et al., 2014), though effective for smooth unconstrained optimization with compression (Karimireddy et al., 2019), fail in the broader and practically important setting of composite optimization, which captures, e.g., objectives consisting of a smooth loss combined with a non-smooth regularizer or constr…

Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
Ilyas Fatkhullin, Niao He, Guanghui Lan, Florian Wolf
https://arxiv.org/abs/2511.10626 https://arxiv.org/pdf/2511.10626 https://arxiv.org/html/2511.10626
arXiv:2511.10626v1 Announce Type: new
Abstract: Constrained non-convex optimization is fundamentally challenging, as global solutions are generally intractable and constraint qualifications may not hold. However, in many applications, including safe policy optimization in control and reinforcement learning, such problems possess hidden convexity, meaning they can be reformulated as convex programs via a nonlinear invertible transformation. Typically such transformations are implicit or unknown, making the direct link with the convex program impossible. On the other hand, (sub-)gradients with respect to the original variables are often accessible or can be easily estimated, which motivates algorithms that operate directly in the original (non-convex) problem space using standard (sub-)gradient oracles. In this work, we develop the first algorithms to provably solve such non-convex problems to global minima. First, using a modified inexact proximal point method, we establish global last-iterate convergence guarantees with $\widetilde{\mathcal{O}}(\varepsilon^{-3})$ oracle complexity in non-smooth setting. For smooth problems, we propose a new bundle-level type method based on linearly constrained quadratic subproblems, improving the oracle complexity to $\widetilde{\mathcal{O}}(\varepsilon^{-1})$. Surprisingly, despite non-convexity, our methodology does not require any constraint qualifications, can handle hidden convex equality constraints, and achieves complexities matching those for solving unconstrained hidden convex optimization.
toXiv_bot_toot

Split hyperplane sections on smooth polarized $K3$-surfaces
Alex Degtyarev
https://arxiv.org/abs/2509.24349 https://arxiv.org/pdf/2509.24349

Split hyperplane sections on smooth polarized $K3$-surfaces
We study hyperplane sections of smooth polarized $K3$-surfaces that split into unions of lines. We describe the dual adjacency graphs of such sections and find sharp upper bounds on their number. In most cases (starting from degree $6$), we also compute all configurations of such sections.

🇺🇦 #NowPlaying on KEXP's #PacificNotions
SHOLTO:
🎵 Smooth Sailing (Ft. Phoebe Coco)
#SHOLTO
https://sholto2.bandcamp.com/track/smooth-sailing-ft-phoebe-coco
https://open.spotify.com/track/5aEW2bzWojUCrjJPvHu0bI

Smooth Quasar-Convex Optimization with Constraints
David Mart\'inez-Rubio
https://arxiv.org/abs/2510.01943 https://arxiv.org/pdf/2510.01943

Smooth Quasar-Convex Optimization with Constraints
Quasar-convex functions form a broad nonconvex class with applications to linear dynamical systems, generalized linear models, and Riemannian optimization, among others. Current nearly optimal algorithms work only in affine spaces due to the loss of one degree of freedom when working with general convex constraints. Obtaining an accelerated algorithm that makes nearly optimal $\widetilde{O}(1/(γ\sqrtε))$ first-order queries to a $γ$-quasar convex smooth function \emph{with constraints} was i…

Rank Two Sheaves With Low Discriminant on the Fano Threefold of Index 2 and Degree 5
Danil A. Vassiliev
https://arxiv.org/abs/2510.10608 https://arxiv.org/…

Rank Two Sheaves With Low Discriminant on the Fano Threefold of Index 2 and Degree 5
We describe rank 2 Gieseker semistable sheaves $E$ on the Fano threefold $X_5$ of index 2 and degree 5 with maximal third Chern class $c_3(E)$ for all possible low values of discriminant $\overlineΔ_H(E)\le 40$. The work uses the theory of tilt-stability and Bridgeland stability conditions on smooth projective threefolds. We also make a conjecture about the rank 2 sheaves on $X_5$ with maximal $c_3$ and discriminant big enough.

🇺🇦 #NowPlaying on KEXP's #VarietyMix
Al Jarreau:
🎵 Mornin’
#AlJarreau
https://phbrussels.bandcamp.com/track/george-benson-al-jarreau-mornin-ph-smooth-jazzz-edit
https://open.spotify.com/track/7duYnNL1sEl7uLlLAX3Gdg

Moduli of lattice-polarized K3 surfaces and boundedness of Brauer groups
Danny Bragg, Emma Brakkee, Anthony V\'arilly-Alvarado
https://arxiv.org/abs/2510.11477 https://

Moduli of lattice-polarized K3 surfaces and boundedness of Brauer groups
Inspired by constructions over the complex numbers of Dolgachev and Alexeev-Engel, we define moduli stacks $\mathcal{M}_{(L,\mathcal{A})/\mathbb{Z}}$ of lattice-polarized K3 surfaces over arbitrary bases, paying particular attention to the open locus $\mathcal{P}_{(L,\mathcal{A})/\mathbb{Z}}$ of primitive lattice polarizations. We introduce the notion of very small ample cones $\mathcal{a}$, after Alexeev and Engel's small cones, to construct smooth, separated stacks of lattice polarized K3 sur…

Approximate Bregman proximal gradient algorithm with variable metric Armijo--Wolfe line search
Kiwamu Fujiki, Shota Takahashi, Akiko Takeda
https://arxiv.org/abs/2510.06615 http…

Approximate Bregman proximal gradient algorithm with variable metric Armijo--Wolfe line search
We propose a variant of the approximate Bregman proximal gradient (ABPG) algorithm for minimizing the sum of a smooth nonconvex function and a nonsmooth convex function. Although ABPG is known to converge globally to a stationary point even when the smooth part of the objective function lacks globally Lipschitz continuous gradients, and its iterates can often be expressed in closed form, ABPG relies on an Armijo line search to guarantee global convergence. Such reliance can slow down performanc…

Nonlinearly Preconditioned Gradient Methods: Momentum and Stochastic Analysis
Konstantinos Oikonomidis, Jan Quan, Panagiotis Patrinos
https://arxiv.org/abs/2510.11312 https://…

Nonlinearly Preconditioned Gradient Methods: Momentum and Stochastic Analysis
We study nonlinearly preconditioned gradient methods for smooth nonconvex optimization problems, focusing on sigmoid preconditioners that inherently perform a form of gradient clipping akin to the widely used gradient clipping technique. Building upon this idea, we introduce a novel heavy ball-type algorithm and provide convergence guarantees under a generalized smoothness condition that is less restrictive than traditional Lipschitz smoothness, thus covering a broader class of functions. Addit…

Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism
Francisco Patitucci, Ruichen Jiang, Aryan Mokhtari
https://arxiv.org/abs/2510.03167 https://…

Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism
A recent breakthrough in nonconvex optimization is the online-to-nonconvex conversion framework of \cite{cutkosky2023optimal}, which reformulates the task of finding an $\varepsilon$-first-order stationary point as an online learning problem. When both the gradient and the Hessian are Lipschitz continuous, instantiating this framework with two different online learners achieves a complexity of $\mathcal{O}(\varepsilon^{-1.75}\log(1/\varepsilon))$ in the deterministic case and a complexity of $\…

Quantum Schubert calculus for smooth Schubert divisors of $F\ell_n$
Changzheng Li, Jiayu Song, Rui Xiong, Mingzhi Yang
https://arxiv.org/abs/2509.17857 https://

Quantum Schubert calculus for smooth Schubert divisors of $F\ell_n$
We propose to study the quantum Schubert calculus for Schubert varieties, and investigate the smooth Schubert divisors X of the complete flag variety Fl_n. We provide a Borel-type ring presentation of the quantum cohomology of X. We derive the quantum Chevalley formula for X by geometric arguments. We also show that the quantum Schubert polynomials for X are the same as that for Fl_n introduced by Fomin, Gelfand and Postnikov.

ProxSTORM -- A Stochastic Trust-Region Algorithm for Nonsmooth Optimization
Robert J. Baraldi, Aurya Javeed, Drew P. Kouri, Katya Scheinberg
https://arxiv.org/abs/2510.03187 htt…

ProxSTORM -- A Stochastic Trust-Region Algorithm for Nonsmooth Optimization
We develop a stochastic trust-region algorithm for minimizing the sum of a possibly nonconvex Lipschitz-smooth function that can only be evaluated stochastically and a nonsmooth, deterministic, convex function. This algorithm, which we call ProxSTORM, generalizes STORM [1, 2] -- a stochastic trust-region algorithm for the unconstrained optimization of smooth functions -- and the inexact deterministic proximal trust-region algorithm in [3]. We generalize and, in some cases, simplify problem assu…