paper-with-me

Papers

Stochastic Streets: A Walk Through Random LLM Address Generation in four European Cities

2025-09-16 · Tairan Fu, David Campo-Nazareno, Javier Coronado-Blázquez, Javier Conde, Pedro Reviriego, Fabrizio Lombardi arxiv

Large Language Models (LLMs) are capable of solving complex math problems or answer difficult questions on almost any topic, but can they generate random street addresses for European cities?

📄 PDF Abstract BibTeX arXiv:2509.12914

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

From Street View Imagery to Street Quality Indicators: Vision Language Inference for the Suburban 15-minute City

2026-08-20 · Joan Perez, Giovanni Fusco arxiv

Streetscape quality has become a central concern in contemporary urban planning, particularly within the framework of the pedestrian-friendly 15-minute city, where walkability and public-space quality are increasingly re…

Robust Stochastic Gradient Posterior Sampling with Lattice Based Discretisation

2026-02-17 · Zier Mensch, Lars Holdijk, Samuel Duffield, Maxwell Aifer 외 arxiv

Stochastic-gradient MCMC methods enable scalable Bayesian posterior sampling but often suffer from sensitivity to minibatch size and gradient noise. To address this, we propose Stochastic Gradient Lattice Random Walk (SG…

Mobility Mode Detection Using WiFi Signals

2018-09-16 · Arash Kalatian, Bilal Farooq

We utilize Wi-Fi communications from smartphones to predict their mobility mode, i.e. walking, biking and driving. Wi-Fi sensors were deployed at four strategic locations in a closed loop on streets in downtown Toronto. …

Towards Fundamental Limits of Multi-armed Bandits with Random Walk Feedback

2020-11-03 · Tianyu Wang, Lin F. Yang, Zizhuo Wang

In this paper, we consider a new Multi-Armed Bandit (MAB) problem where arms are nodes in an unknown and possibly changing graph, and the agent (i) initiates random walks over the graph by pulling arms, (ii) observes the…

Multi-Armed BanditsRecommendation Systems

On Zeroth-Order Stochastic Convex Optimization via Random Walks

2014-02-11 · Tengyuan Liang, Hariharan Narayanan, Alexander Rakhlin

We propose a method for zeroth order stochastic convex optimization that attains the suboptimality rate of $\tilde{\mathcal{O}}(n^{7}T^{-1/2})$ after $T$ queries for a convex bounded function $f:{\mathbb R}^n\to{\mathbb …