Tootfinder

Crosslisted article(s) found for math.OC. https://arxiv.org/list/math.OC/new
[1/1]:
- Optimal control of Volterra integral diffusions and application to contract theory
Dylan Possama\"i, Mehdi Talbi
https://arxiv.org/abs/2511.09701 https://mastoxiv.page/@arXiv_mathPR_bot/115547093766733637
- Generalized infinite dimensional Alpha-Procrustes based geometries
Salvish Goomanee, Andi Han, Pratik Jawanpuria, Bamdev Mishra
https://arxiv.org/abs/2511.09801 https://mastoxiv.page/@arXiv_statML_bot/115547135711272091
- Sample Complexity of Quadratically Regularized Optimal Transport
Alberto Gonz\'alez-Sanz, Eustasio del Barrio, Marcel Nutz
https://arxiv.org/abs/2511.09807 https://mastoxiv.page/@arXiv_mathST_bot/115546975796760368
- On the Convergence of Overparameterized Problems: Inherent Properties of the Compositional Struct...
Arthur Castello Branco de Oliveira, Dhruv Jatkar, Eduardo Sontag
https://arxiv.org/abs/2511.09810 https://mastoxiv.page/@arXiv_csLG_bot/115547543989283588
- Implicit Multiple Tensor Decomposition
Kunjing Yang, Libin Zheng, Minru Bai
https://arxiv.org/abs/2511.09916 https://mastoxiv.page/@arXiv_mathNA_bot/115547169767663335
- Theoretical Analysis of Resource-Induced Phase Transitions in Estimation Strategies
Takehiro Tottori, Tetsuya J. Kobayashi
https://arxiv.org/abs/2511.10184 https://mastoxiv.page/@arXiv_physicsbioph_bot/115546979073652600
- Zeroes and Extrema of Functions via Random Measures
Athanasios Christou Micheas
https://arxiv.org/abs/2511.10293 https://mastoxiv.page/@arXiv_statME_bot/115547493525198835
- Operator Models for Continuous-Time Offline Reinforcement Learning
Nicolas Hoischen, Petar Bevanda, Max Beier, Stefan Sosnowski, Boris Houska, Sandra Hirche
https://arxiv.org/abs/2511.10383 https://mastoxiv.page/@arXiv_statML_bot/115547254989932993
- On topological properties of closed attractors
Wouter Jongeneel
https://arxiv.org/abs/2511.10429 https://mastoxiv.page/@arXiv_mathDS_bot/115547276594491411
- Learning parameter-dependent shear viscosity from data, with application to sea and land ice
Gonzalo G. de Diego, Georg Stadler
https://arxiv.org/abs/2511.10452 https://mastoxiv.page/@arXiv_mathNA_bot/115547323782478749
- Formal Verification of Control Lyapunov-Barrier Functions for Safe Stabilization with Bounded Con...
Jun Liu
https://arxiv.org/abs/2511.10510 https://mastoxiv.page/@arXiv_eessSY_bot/115547429321496393
- Direction-of-Arrival and Noise Covariance Matrix joint estimation for beamforming
Vitor Gelsleichter Probst Curtarelli
https://arxiv.org/abs/2511.10639 https://mastoxiv.page/@arXiv_eessAS_bot/115547188796143762
toXiv_bot_toot

👀
🔗 #GustavoGatica

We have a Target nearby in Forest Hills. At the rate they're going, I don't know how longer they'll last (I certainly have stopped going there!)
https://skyview.social/?url=https:%2F/…

Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Perturbation-assisted Observation of the Lowest Vibrational Level of the $\mathrm{b}^{3}\Pi_{0}$ ...
Yang, Nie, Yu, Liu, Avalos, He, Klos, Kotochigova, Dieckmann
https://arxiv.org/abs/2510.17166 https://mastoxiv.page/@arXiv_physicsatomph_bot/115411364513995859
- Direct Measurement of the $5s5p\,{}^1P_1 \to 5s4d\,{}^1D_2$ Decay Rate in Strontium
Naohiro Okamoto, Takatoshi Aoki, Yoshio Torii
https://arxiv.org/abs/2510.22184 https://mastoxiv.page/@arXiv_physicsatomph_bot/115450966319591523
- Turbulence and far-from-equilibrium equation of state of Bogoliubov waves in Bose-Einstein Conden...
Ying Zhu, Giorgio Krstulovic, Sergey Nazarenko
https://arxiv.org/abs/2408.15163 https://mastoxiv.page/@arXiv_condmatquantgas_bot/113038670682163852
- Observation of quantum free fall and the consistency with the equivalence principle
Or Dobkowski, et al.
https://arxiv.org/abs/2502.14535 https://mastoxiv.page/@arXiv_quantph_bot/114040790353608831
- Microwave-field quantum metrology with inherent robustness against detection losses enabled by Ry...
Kurzyna, Niewelt, Mazelanik, Wasilewski, Demkowicz-Dobrza\'nski, Parniak
https://arxiv.org/abs/2505.01506 https://mastoxiv.page/@arXiv_quantph_bot/114459737137154531
toXiv_bot_toot

Crosslisted article(s) found for cs.LG. https://arxiv.org/list/cs.LG/new
[1/3]:
- Optimizing Text Search: A Novel Pattern Matching Algorithm Based on Ukkonen's Approach
Xinyu Guan, Shaohua Zhang
https://arxiv.org/abs/2512.16927 https://mastoxiv.page/@arXiv_csDS_bot/115762062326187898
- SpIDER: Spatially Informed Dense Embedding Retrieval for Software Issue Localization
Shravan Chaudhari, Rahul Thomas Jacob, Mononito Goswami, Jiajun Cao, Shihab Rashid, Christian Bock
https://arxiv.org/abs/2512.16956 https://mastoxiv.page/@arXiv_csSE_bot/115762248476963893
- MemoryGraft: Persistent Compromise of LLM Agents via Poisoned Experience Retrieval
Saksham Sahai Srivastava, Haoyu He
https://arxiv.org/abs/2512.16962 https://mastoxiv.page/@arXiv_csCR_bot/115762140339109012
- Colormap-Enhanced Vision Transformers for MRI-Based Multiclass (4-Class) Alzheimer's Disease Clas...
Faisal Ahmed
https://arxiv.org/abs/2512.16964 https://mastoxiv.page/@arXiv_eessIV_bot/115762196702065869
- Probing Scientific General Intelligence of LLMs with Scientist-Aligned Workflows
Wanghan Xu, et al.
https://arxiv.org/abs/2512.16969 https://mastoxiv.page/@arXiv_csAI_bot/115762050529328276
- PAACE: A Plan-Aware Automated Agent Context Engineering Framework
Kamer Ali Yuksel
https://arxiv.org/abs/2512.16970 https://mastoxiv.page/@arXiv_csAI_bot/115762054461584205
- A Women's Health Benchmark for Large Language Models
Elisabeth Gruber, et al.
https://arxiv.org/abs/2512.17028 https://mastoxiv.page/@arXiv_csCL_bot/115762049873946945
- Perturb Your Data: Paraphrase-Guided Training Data Watermarking
Pranav Shetty, Mirazul Haque, Petr Babkin, Zhiqiang Ma, Xiaomo Liu, Manuela Veloso
https://arxiv.org/abs/2512.17075 https://mastoxiv.page/@arXiv_csCL_bot/115762077400293945
- Disentangled representations via score-based variational autoencoders
Benjamin S. H. Lyo, Eero P. Simoncelli, Cristina Savin
https://arxiv.org/abs/2512.17127 https://mastoxiv.page/@arXiv_statML_bot/115762251753966702
- Biosecurity-Aware AI: Agentic Risk Auditing of Soft Prompt Attacks on ESM-Based Variant Predictors
Huixin Zhan
https://arxiv.org/abs/2512.17146 https://mastoxiv.page/@arXiv_csCR_bot/115762318582013305
- Application of machine learning to predict food processing level using Open Food Facts
Arora, Chauhan, Rana, Aditya, Bhagat, Kumar, Kumar, Semar, Singh, Bagler
https://arxiv.org/abs/2512.17169 https://mastoxiv.page/@arXiv_qbioBM_bot/115762302873829397
- Systemic Risk Radar: A Multi-Layer Graph Framework for Early Market Crash Warning
Sandeep Neela
https://arxiv.org/abs/2512.17185 https://mastoxiv.page/@arXiv_qfinRM_bot/115762275982224870
- Do Foundational Audio Encoders Understand Music Structure?
Keisuke Toyama, Zhi Zhong, Akira Takahashi, Shusuke Takahashi, Yuki Mitsufuji
https://arxiv.org/abs/2512.17209 https://mastoxiv.page/@arXiv_csSD_bot/115762341541572505
- CheXPO-v2: Preference Optimization for Chest X-ray VLMs with Knowledge Graph Consistency
Xiao Liang, Yuxuan An, Di Wang, Jiawei Hu, Zhicheng Jiao, Bin Jing, Quan Wang
https://arxiv.org/abs/2512.17213 https://mastoxiv.page/@arXiv_csCV_bot/115762574180736975
- Machine Learning Assisted Parameter Tuning on Wavelet Transform Amorphous Radial Distribution Fun...
Deriyan Senjaya, Stephen Ekaputra Limantoro
https://arxiv.org/abs/2512.17245 https://mastoxiv.page/@arXiv_condmatmtrlsci_bot/115762447037143855
- AlignDP: Hybrid Differential Privacy with Rarity-Aware Protection for LLMs
Madhava Gaikwad
https://arxiv.org/abs/2512.17251 https://mastoxiv.page/@arXiv_csCR_bot/115762396593872943
- Practical Framework for Privacy-Preserving and Byzantine-robust Federated Learning
Baolei Zhang, Minghong Fang, Zhuqing Liu, Biao Yi, Peizhao Zhou, Yuan Wang, Tong Li, Zheli Liu
https://arxiv.org/abs/2512.17254 https://mastoxiv.page/@arXiv_csCR_bot/115762402470985707
- Verifiability-First Agents: Provable Observability and Lightweight Audit Agents for Controlling A...
Abhivansh Gupta
https://arxiv.org/abs/2512.17259 https://mastoxiv.page/@arXiv_csMA_bot/115762225538364939
- Warmer for Less: A Cost-Efficient Strategy for Cold-Start Recommendations at Pinterest
Saeed Ebrahimi, Weijie Jiang, Jaewon Yang, Olafur Gudmundsson, Yucheng Tu, Huizhong Duan
https://arxiv.org/abs/2512.17277 https://mastoxiv.page/@arXiv_csIR_bot/115762214396869930
- LibriVAD: A Scalable Open Dataset with Deep Learning Benchmarks for Voice Activity Detection
Ioannis Stylianou, Achintya kr. Sarkar, Nauman Dawalatabad, James Glass, Zheng-Hua Tan
https://arxiv.org/abs/2512.17281 https://mastoxiv.page/@arXiv_csSD_bot/115762361858560703
- Penalized Fair Regression for Multiple Groups in Chronic Kidney Disease
Carter H. Nakamoto, Lucia Lushi Chen, Agata Foryciarz, Sherri Rose
https://arxiv.org/abs/2512.17340 https://mastoxiv.page/@arXiv_statME_bot/115762446402738033
toXiv_bot_toot

◍ Diverse particles form identical geometric patterns when confined, model reveals
https://phys.org/news/2025-11-diverse-particles-identical-geometric-patterns.html

Diverse particles form identical geometric patterns when confined, model reveals
Particles as different as soap bubbles and ball bearings can be made to arrange themselves in exactly the same way, according to a new study that could unlock the creation of brand new materials—including those with promising biomedical applications.

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

Deformation quantisation of exact shifted symplectic structures, with an application to vanishing cycles
J. P. Pridham
https://arxiv.org/abs/2511.07602 https://arxiv.org/pdf/2511.07602 https://arxiv.org/html/2511.07602
arXiv:2511.07602v1 Announce Type: new
Abstract: We extend the author's and CPTVV's correspondence between shifted symplectic and Poisson structures to establish a correspondence between exact shifted symplectic structures and non-degenerate shifted Poisson structures with formal derivation, a concept generalising constructions by De Wilde and Lecomte. Our formulation is sufficiently general to encompass derived algebraic, analytic and $\mathcal{C}^{\infty}$ stacks, as well as Lagrangians and non-commutative generalisations. We also show that non-degenerate shifted Poisson structures with formal derivation carry unique self-dual deformation quantisations in any setting where the latter can be formulated.
One application is that for (not necessarily exact) $0$-shifted symplectic structures in analytic and $\mathcal{C}^{\infty}$ settings, it follows that the author's earlier parametrisations of quantisations are in fact independent of any choice of associator, and generalise Fedosov's parametrisation of quantisations for classical manifolds.
Our main application is to complex $(-1)$-shifted symplectic structures, showing that our unique quantisation of the canonical exact structure, a sheaf of twisted $BD_0$-algebras with derivation, gives rise to BBDJS's perverse sheaf of vanishing cycles, equipped with its monodromy operator.
toXiv_bot_toot

Verification of Sequential Convex Programming for Parametric Non-convex Optimization
Rajiv Sambharya, Nikolai Matni, George Pappas
https://arxiv.org/abs/2511.10622 https://arxiv.org/pdf/2511.10622 https://arxiv.org/html/2511.10622
arXiv:2511.10622v1 Announce Type: new
Abstract: We introduce a verification framework to exactly verify the worst-case performance of sequential convex programming (SCP) algorithms for parametric non-convex optimization. The verification problem is formulated as an optimization problem that maximizes a performance metric (e.g., the suboptimality after a given number of iterations) over parameters constrained to be in a parameter set and iterate sequences consistent with the SCP update rules. Our framework is general, extending the notion of SCP to include both conventional variants such as trust-region, convex-concave, and prox-linear methods, and algorithms that combine convex subproblems with rounding steps, as in relaxing and rounding schemes. Unlike existing analyses that may only provide local guarantees under limited conditions, our framework delivers global worst-case guarantees--quantifying how well an SCP algorithm performs across all problem instances in the specified family. Applications in control, signal processing, and operations research demonstrate that our framework provides, for the first time, global worst-case guarantees for SCP algorithms in the parametric setting.
toXiv_bot_toot

Measuring dissimilarity between convex cones by means of max-min angles
Welington de Oliveira, Valentina Sessa, David Sossa
https://arxiv.org/abs/2511.10483 https://arxiv.org/pdf/2511.10483 https://arxiv.org/html/2511.10483
arXiv:2511.10483v1 Announce Type: new
Abstract: This work introduces a novel dissimilarity measure between two convex cones, based on the max-min angle between them. We demonstrate that this measure is closely related to the Pompeiu-Hausdorff distance, a well-established metric for comparing compact sets. Furthermore, we examine cone configurations where the measure admits simplified or analytic forms. For the specific case of polyhedral cones, a nonconvex cutting-plane method is deployed to compute, at least approximately, the measure between them. Our approach builds on a tailored version of Kelley's cutting-plane algorithm, which involves solving a challenging master program per iteration. When this master program is solved locally, our method yields an angle that satisfies certain necessary optimality conditions of the underlying nonconvex optimization problem yielding the dissimilarity measure between the cones. As an application of the proposed mathematical and algorithmic framework, we address the image-set classification task under limited data conditions, a task that falls within the scope of the \emph{Few-Shot Learning} paradigm. In this context, image sets belonging to the same class are modeled as polyhedral cones, and our dissimilarity measure proves useful for understanding whether two image sets belong to the same class.
toXiv_bot_toot