Home Knowledge Base \pi^*_x$

\pi^*_x$

No mentions found

This entity hasn't been tracked yet, or Iris is still building its knowledge base.

Related Articles from SNS

Inverse Entropic Optimal Transport Solves Semi-supervised Learning via Data Likelihood Maximization

arXiv:2410.02628v5 Announce Type: replace Abstract: Learning conditional distributions $\pi^*(\cdot|x)$ is a central problem in machine learning, which is typically approached via supervised methods with paired data $(x,y) \sim \pi^*$. However, acquiring paired data samples is often challenging, especially in problems such as domain translation. This necessitates the development of $\textit{semi-supervised}$ models that utilize both limited paired data and additional unpaired i.i.d. samples...

arXiv CS 5d ago

I built a vulnerable app and spent $1,500 seeing if LLMs could hack it

I built a vulnerable app and spent $1,500 seeing if LLMs could hack it As a part of my work I do security research for various apps and websites. I wanted to see if LLMs could reproduce a common class of exploits I’ve found in multiple apps. I made a fake React Native app in Expo and a backend in Python.

Hacker News 6d ago

Benchmarking Vision-Language-Action Models on SO-101: Failure and Recovery Analysis

arXiv:2606.08881v1 Announce Type: new Abstract: Vision-Language-Action (VLA) models have demonstrated strong generalization in robotic manipulation, yet existing evaluations are primarily conducted in simulation or on expensive robotic platforms, leaving their robustness on affordable real-world robots largely unexplored. We present a standardized real-world benchmark for evaluating representative VLA and imitation learning policies on the low-cost SO-101 robotic platform. The benchmark...

arXiv CS 1d ago

True Self-Avoiding Walk for Accelerating Markov-Chain Monte Carlo Integration

Announce Type: cross Abstract: We study true self-avoiding walk (TSAW) as a mechanism for improving empirical integral estimation via Markov chain Monte Carlo (MCMC). We consider finite-state adaptive sampling dynamics associated with an irreducible Markov kernel $P$ on a finite set, with stationary distribution $\pi$, in which the transition probabilities are penalized according to empirical overuse. Our main result is that the empirical occupation counts $L_t(i)$ and transition counts...

arXiv CS 9d ago

VISTA: Vision-Grounded and Physics-Validated Adaptation of UMI data for VLA Training

Announce Type: new Abstract: Universal Manipulation Interface (UMI) enables scalable real-world robot data collection without hardware-specific teleoperation, yet leveraging UMI data to train large-scale Vision-Language-Action (VLA) models remains fundamentally challenging. We identify two critical mismatches: wrist-mounted fisheye views, with severe radial distortion and local gripper-centric perspectives, are out-of-distribution for pretrained VLMs; and human-collected trajectories...

arXiv CS 6d ago

VISTA: Vision-Grounded and Physics-Validated Adaptation of UMI data for VLA Training

arXiv:2606.04708v2 Announce Type: replace Abstract: Universal Manipulation Interface (UMI) enables scalable real-world robot data collection without hardware-specific teleoperation, yet leveraging UMI data to train large-scale Vision-Language-Action (VLA) models remains fundamentally challenging. We identify two critical mismatches: wrist-mounted fisheye views, with severe radial distortion and local gripper-centric perspectives, are out-of-distribution for pretrained VLMs; and...

arXiv CS 5d ago

Flipper One wants to be the Linux multi-tool in your pocket

Flipper Devices has unveiled the Flipper One, an ARM-based Linux computer designed as a versatile multi-tool, featuring extensive connectivity like HDMI and Gigabit Ethernet. Unlike the Flipper Zero, the One is a full Linux computer with 8GB of RAM and 64GB of storage, priced around $350 for the base model. The company aims for full mainline Linux kernel support to ensure broad compatibility and flexibility for users.

The Register 20d ago

Lightning Plus Polynomial Approximation: Optimal Root-Exponential Convergence for Singular Functions in Corner Domains

Announce Type: replace Abstract: This paper presents a rigorous convergence analysis for the lightning plus polynomial approximation scheme, which employs rational approximations constructed with preassigned tapered, exponentially clustered poles. This pole placement strategy was originally introduced by Trefethen and his collaborators for the resolution of corner singularities. Ample numerical results indicate that this scheme achieves root-exponential convergence, and in particular attains...

arXiv CS 6d ago

High-Rate Quantized Matrix Multiplication II

arXiv:2605.13768v2 Announce Type: replace Abstract: This is the second part of the work investigating quantized matrix multiplication (MatMul). In part I we considered the case of calibration-free quantization, whereas here we discuss the setting where covariance matrix $\Sigma_X$ of the columns of the second factor is available. This setting arises in the ubiquitous task of weight-only post-training quantization of LLMs.

arXiv CS 1d ago

Lightning Plus Polynomial Approximation: Optimal Root-Exponential Convergence for Singular Functions in Corner Domains

Announce Type: new Abstract: This work presents a rigorous convergence analysis for the lightning plus polynomial approximation scheme, which employs rational approximations constructed with tapered, exponentially clustered poles. This pole placement strategy was originally introduced by Trefethen and his collaborators for the resolution of corner singularities.

arXiv CS 9d ago