Pith. sign in

hub Mixed citations

Advances in neural information processing systems , volume=

Mixed citation behavior. Most common role is method (50%).

95 Pith papers citing it
Method 50% of classified citations

hub tools

citation-role summary

background 4 method 4

citation-polarity summary

claims ledger

  • method Interpolation achieves lower entropy, reflecting a sharper distri- bution critical for precise localization. For more details of this analysis, please refer toApp. F. mtext ∈ {0,1} Ly to isolate the target entity within the prompt Ytgt. Let Itgt denote the set of token indices of the target subject (e.g., "violin"). The mask is defined as: mtext i = ( 1,ifi∈ I tgt 0,otherwise (12) Subsequently, a Spatio-Textual Bias MatrixB is synthesized via the outer product of g=Flatten(G)∈R Lz and the token
  • method − 1 2 (x−𝜇) ⊤Σ−1 (x−𝜇)  .(1) The covariance is optimized via a factored representation Σ= RSS⊤R⊤ to ensure semi-definiteness. To render the scene, 3D Gaussians are projected into 2D image space. The final color 𝐶 of a pixel is computed by alpha-blending 𝑁 ordered Gaussians overlapping the pixel: 𝐶= 𝑁∑︁ 𝑖=1 𝑐𝑖𝛼𝑖𝐺 2𝐷 𝑖 (x) 𝑖−1Ö 𝑗=1 (1−𝛼 𝑗𝐺 2𝐷 𝑗 (x)),(2) where 𝑐𝑖, 𝛼𝑖, and𝐺 2𝐷 𝑖 (x) denote the color, opacity, and the evaluation of the𝑖-th projected 2D Gaussian at pixel positionx, respectively. 3.2
  • method M=⟨S,A,Θ,T,R, γ, P Θ⟩, where S is the state space, A is the action space, and Θ is the space of task-specific latent parameters. For each θ∈Θ , the transition and reward functions are given by Tθ :S × A → P(S) and Rθ :S × A →R , respectively. The parameter θ is sampled from a prior distribution PΘ at the beginning of an episode and remains fixed during the episode. The discount factor is denoted by γ∈[0,1) . This framework defines a family of MDPs indexed by the latent parameter θ, with each θ i
  • background decoder D, which takes latent tokens L from the Perceiver Resam- pler and outputs head meshes with consistent topology. Given the shared face connectivity F across all training meshes, the mesh structure naturally defines a graphG. Graph Convolution.For vertex 𝑣𝑖 with feature 𝐹𝑖 and neighbors N (𝑖), our graph convolution is defined as: 𝐹 ′ 𝑖 =𝑊 0𝐹𝑖 + Í 𝑗∈ N (𝑖) 𝑊1𝐹 𝑗,(1) , Vol. 1, No. 1, Article . Publication date: May 2026. 4•Bojun Xiong, Zoubin Bi, Xinghui Peng, Yunmu Wang, Junchen Deng, Jun L
  • background dynamics in these directions remain diffusive. Although the effective diffusion coefficientηdk turns out to be very small, the large number of these nearly-flat directions leads to a noticeable divergence of individual trajectories. In the directions with large eigenvaluesηnλi ≫1the system reaches the stationary state given by Πii n ≈ ηdi 2λi −ηλ 2 i −ηΓ ii .(39) The behavior in the other (intermediate) directions is in between these two limiting cases. We also observe empirically that, for dire
  • background t (see Section 5); for learned ¯vthe residual remains random but acts as a control variate. 4 Path-Coupled Bellman Flows for Distributional Reinforcement Learning Figure 1.The Architecture of Path-Coupled Bellman Flows (PCBF). Using this control variate, we define the PCBF training target as follows: uλ t := (R+γX ′−X0)+λ h vθ−(t, Zs′ t |s ′, a′)−(X ′ −X 0) i . (13) Setting λ= 0 recovers the baseline BCFM estimator (un- biased, high variance). Nonzero λ introduces a variance- reducing correction

co-cited works

years

2026 90 2024 5

representative citing papers

Diffeomorphic Optimization

cs.LG · 2026-07-01 · unverdicted · novelty 7.0

Proposes diffeomorphic optimization for manifold-constrained problems in generative models via flow maps, with Lie-group extensions for protein design showing metric improvements.

FlexiSLM: A Dynamic and Controllable Frame Rate Spoken Language Model

cs.SD · 2026-06-30 · unverdicted · novelty 7.0

FlexiSLM is the first spoken language model supporting dynamic and controllable frame rates on speech input and output, outperforming fixed-rate 7B models at high quality and enabling faster inference at lower rates like 6.25 Hz.

Let EEG Models Learn EEG

cs.CV · 2026-05-20 · unverdicted · novelty 7.0

JET is a conditional flow matching framework that generates EEG as continuous raw sequences with added constraints for spectral and temporal properties, achieving over 40% lower TS-FID than prior discrete denoising methods on three benchmarks.

When Does Model Collapse Occur in Structured Interactive Learning?

cs.LG · 2026-05-19 · unverdicted · novelty 7.0

Model collapse occurs in structured interactive learning if and only if the directed interaction graph satisfies a specific topological condition, with finite-sample guarantees for linear regression and asymptotic results for M-estimators.

Mat\'ern Noise for Triangulation-Agnostic Flow Matching on Meshes

cs.GR · 2026-05-19 · unverdicted · novelty 7.0

Proposes discretized Matérn process noise for triangulation-agnostic flow matching on meshes with PoissonNet denoiser, tested on elastic states and humanoid poses for meshes exceeding one million triangles.

Support Before Frequency in Discrete Diffusion

cs.LG · 2026-05-13 · unverdicted · novelty 7.0

Discrete diffusion models learn data support before frequencies because the exact reverse process decomposes edits into a dominant validity scale and a finer probability coefficient.

Generative Transfer for Entropic Optimal Transport with Unknown Costs

math.OC · 2026-05-12 · unverdicted · novelty 7.0

A generative transfer framework using iterative path-wise tilting integrated with conditional flow matching recovers target entropic optimal transport couplings from reference samples, achieving O(δ) convergence in Wasserstein-1 distance.

Relative Score Policy Optimization for Diffusion Language Models

cs.CL · 2026-05-11 · unverdicted · novelty 7.0

RSPO interprets reward advantages as targets for relative log-ratios in dLLMs, calibrating noisy estimates to stabilize RLVR training and achieve strong gains on planning tasks with competitive math reasoning performance.

citing papers explorer

Showing 50 of 95 citing papers.