跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+758新增论文
+578其中 AI 相关
+94已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-17 04:58 · 全站最近入库:2026-11-17 04:58各信源进度 →

统计口径与数据新鲜度

统计 2026-11-16 09:18 — 2026-11-17 09:18(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-17 04:58最近发现新增版本:2026-11-17 04:58库内论文最新更新时间:2026-11-14 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

24,106 已收录论文20,158 AI 相关7,049 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 7 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
新论文 · v1arXiv:2611.12319

Mitigating SM-Level Load Imbalance in 3D Gaussian Splatting on GPUs

Junha Ryu, Hoi-Jun Yoo

原文摘要

3D Gaussian Splatting (3DGS) enables photorealistic, real-time rendering on commodity GPUs and is increasingly adopted in generative world models and autonomous driving simulators. However, existing optimizations rely on algorithmic changes that often require retraining, or on specialized accelerators that lack flexibility across evolving 3DGS variants. In this paper, we identify a fundamental inefficiency in GPU-based 3DGS rendering: severe SM-level load imbalance caused by uneven workloads across screen tiles. This imbalance creates a long execution tail, leaving most SMs idle while a few process computationally intensive tiles, particularly in large-scale urban scenes. To address this, we present a software-defined GPU scheduling approach that mitigates the execution tail. Our approach uses a persistent kernel to schedule heavy tiles first and selectively chunks outlier tiles across multiple CTAs. A lightweight per-frame policy determines when and how much to chunk using tile statistics already available in the rendering pipeline. Our approach requires neither retraining nor specialized hardware and can be applied orthogonally to existing optimizations across diverse 3DGS variants. Averaged per scene, it accelerates alpha blending by up to 2.93x on a large-scale urban scene, and by up to 5.6x on its most imbalanced frames, while retaining the original alpha blending formulation.

cs.DC · cs.CV · cs.GR · cs.LG

版本更新 · v2arXiv:2609.11894

3D Point Splatting for mmWave Radar Novel View Synthesis

Adnan Armouti, Yixuan Gao, Rajalakshmi Nandakumar

原文摘要

Solving novel view synthesis (NVS) for millimeter-wave (mmWave) radar requires a renderer that is physically faithful, complex-valued, and multi-viewpoint-tractable. No prior method achieves these three properties simultaneously. Differentiable Monte Carlo (MC) ray tracers implement the radar forward model directly with explicit material modeling and complex outputs, but a joint fit across views takes over an hour per scene. Optical-NVS ports of NeRF, hash grids, and 3D Gaussians train fast but discard phase and replace explicit material modeling with opaque learned features, restricting them to power-only range-azimuth (RA) magnitudes. We propose 3D Point Splatting (3DPS), the first differentiable point splatting renderer for radar, derived directly from the standard solid-angle form of the radar equation. Each oriented 3D point carries a material model built on ITU-R P.2040 permittivity and slab reflection, evaluated in closed form, with the resulting complex phasor splatted into range bins through a precomputed point spread function (PSF). The complex-valued output makes the renderer product-agnostic. The same optimized scene yields analog-to-digital converter (ADC), complex range profile (CRP), and RA outputs through standard fast Fourier transform (FFT) pipelines without retraining for each format. On six outdoor ColoRadar scenes, 3DPS reaches 0.587 mean Pearson correlation on held-out RA images. This is between 1.7x and 5.2x the three optical-NVS baselines (RadarSplat, Radar Fields, DART) and 1.3x the mmIR ray tracer at 1/25 of its wall-clock time. Training takes approximately 3 minutes per scene on a single RTX 4090. Project page: https://3d-point-splatting.github.io/

cs.CV · cs.GR · cs.LG · eess.SP

新论文 · v1arXiv:2611.10599

The RenAIssance: Caption-Guided Diffusion Models for Historical-Art Visual Media

Zhanyu Tuo

原文摘要

Generative AI can expand cultural collections into prompt-responsive visual media, but historical artworks rarely provide the paired descriptions needed to adapt modern image generators. We present The RenAIssance, a scalable pipeline that turns a collection of historical European artworks into a reusable text-to-image media resource. The pipeline generates scene-level captions with BLIP and uses the resulting approximately 15,000 image--text pairs from DEArt to train a compact LoRA adapter for Stable Diffusion v1.5. The adapter shifts generated images toward the historical-art distribution while retaining the base model's ability to render novel concepts. On historical and contemporary prompts of different lengths, it improves FID to the DEArt reference distribution in every setting with only a modest decrease in CLIP text--image similarity. Qualitative results show that the same adapter can render both period-appropriate subjects and contemporary concepts in a coherent historical visual language. By decoupling a reusable style representation from the base generator, the approach offers a practical building block for controllable historical-art media creation, interactive authoring, and rich-media experiences.

cs.CV · cs.AI · cs.LG · cs.MM

新论文 · v1arXiv:2611.08342

面向毫米波雷达微多普勒的可微渲染:4D 点泼溅

4D Point Splatting for mmWave Radar Micro-Doppler Differentiable Rendering

Adnan Armouti, Guanyue Qian, Rajalakshmi Nandakumar

AI 速读 基于摘要

提出基于物理的可微渲染器 4DPS,将显式运动场景拟合到真实毫米波雷达采集,渲染原始复数回波以缩小雷达数据与视觉数据之间的 sim2real 差距。

cs.CV · cs.GR · cs.LG · eess.SP

查看原文摘要

Millimeter-wave radar resolves the micrometer displacements of a moving body as micro-Doppler, enabling gait, gesture, activity, pose and vital-sign sensing. Each task relies on a downstream model trained on real data, yet radar datasets lag orders of magnitude behind vision and language. Brute-force collection will not close that gap, and existing synthesis methods (forward-only simulators, learned generators and static-scene inverse renderers) cannot fit a real capture of a moving body, leaving a sim2real gap. We present 4D Point Splatting (4DPS), a physics-based differentiable renderer that fits an explicit moving scene to a real capture. Using the synchronized camera to initialize the room and body, we represent the scene as oriented points carrying material, normal and velocity, and splat each point into range and Doppler bins. Our output is the raw complex return a real radar records, so we apply the same signal processing on the rendered data to obtain any representation for training any SOTA downstream model. We fit 235 sequences on HuPR and 100 on RT-Pose, two datasets with different radars. Our reconstructions set the state of the art, with median correlations of 0.940 and 0.830 on range-azimuth, 0.829 and 0.695 on range-Doppler, and 0.988 and 0.966 on micro-Doppler. Our renders also set the state of the art in downstream sim2real gap. On RT-Pose, a pose model trained on them reaches 21.9 cm MPJPE on real data, against 16.7 cm for real training and 127.6 cm for the RF-Genesis baseline, where both the rendered- and real-trained models learn nearly the same features. Our custom CUDA kernels fit a sequence in 5.7 minutes on HuPR and 12.9 on RT-Pose on one H100, making dataset-scale inverse rendering of mmWave radar possible for the first time. This work can enable synthetic data generation for any human-centered downstream task and model, and scene editing for data augmentation.

新论文 · v1arXiv:2611.05593

GaussianRenderFormer: Transformer-based Rendering of 3D Gaussian Splats

Shahaf Valencia Levy, Sagie Benaim

原文摘要

Can a neural network learn to render 3D Gaussian splats on its own, with no rasterizer in the renderer? We present GaussianRenderFormer, a transformer that takes a set of Gaussians and a camera and outputs the image directly. Each Gaussian becomes one token in a view-independent encoder, and a view-dependent decoder turns small patches of camera rays into pixels by attending to those tokens. Trained on 26,820 Objaverse objects pruned to 20,000 Gaussians each, GaussianRenderFormer renders 300 unseen objects at 38.08 dB PSNR against the full, unpruned splats, while rasterizing the same pruned input reaches 44.02 dB. The gap is not one of generalization, and our diagnostics are consistent with a bottleneck in the view decoder: telling it the projected footprint of each Gaussian, which it could in principle infer, adds 1.4 dB. Under-training is not ruled out. Code, trained models and videos: https://svlwoof.github.io/gaussianrenderformer

cs.CV · cs.GR · cs.LG

新论文 · v1arXiv:2610.38754

Alpha-TCM: A Nine-Layer Framework for TCM-Guided Multimodal Inference and Structured-Prior Auditing

Yucheng Liu, Everett X. Wang

原文摘要

Alpha-TCM makes two contributions under a central thesis: auditable systems should separate domain knowledge, case evidence, probabilistic inference, and downstream authority. First, it proposes a nine-layer TCM-oriented architecture covering semantic definitions, multimodal acquisition, quality control, provenance-bearing knowledge, probabilistic inference, longitudinal updating, constrained decisions, language interaction, and human governance. Each layer specifies its information contract, failure boundary, dependencies, and validation status. This is a system-design proposal, not a claim of complete clinical implementation. Second, a controlled synthetic prototype instantiates Layers 1-5 to audit the knowledge-evidence interface. Four conditional-Gaussian encoders process synthetic tongue images, pulse waveforms, inquiry fields, and text, while a frozen bridge predicts a five-dimensional synthetic outcome. A versioned contextual prior is compiled independently of the renderer. Fusion removes duplicated reference-prior information before adding context. Equal-information controls, prior regularization, graded contamination, and structural corruption test contextual benefits, Bayesian specificity, and conflict detection. Across ten paired seeds and four training sizes, contextual knowledge improved mean absolute error over marginal committee fusion at 600 and 1,200 cases, but not over equal-information neural controls. Fully incorrect context harmed performance at every size, while prior effects were inconsistent and conflict scores did not track case-level damage. The results support contextual structure in low-data synthetic settings, not a specifically Bayesian advantage. The prototype establishes no claims about TCM theory or clinical, diagnostic, therapeutic, causal, longitudinal, or transfer validity.

cs.LG

版本更新 · v6arXiv:2607.04726

What You See Is What You Get: Observation-Aligned Supervision for Chart-to-Code Generation

Tianhao Niu, Qingfu Zhu, Wanxiang Che

原文摘要

Chart-to-code generation is commonly trained through supervised fine-tuning on reference plotting scripts, implicitly treating the gold code as a fully observable target. However, many chart programs contain latent variables that cannot be uniquely recovered from the rendered image. We identify this latent-observation mismatch in four forms across five chart types: aggregation-induced mismatch, where raw samples are reduced to box statistics or histogram bin masses; normalization-induced mismatch, where absolute scale is removed in pie charts; projection-induced mismatch, where 3D information is lost through 2D rendering; and level-set-induced mismatch, where a scalar field is observable only through selected contour lines. These mismatches introduce target ambiguity and require models to generate information unsupported by the image. We propose Observation-Aligned Supervision, which replaces latent variables with visually constrained quantities. And we study fixed-view 3D scatter and contour charts through controlled experiments. Across VLMs, observation-aligned supervision generally improves observable recovery end-to-end and under both-executable evaluation. Against compact analytic contour formulas, end-to-end performance declines despite better conditional boundary recovery in both-exec setting, suggesting a trade-off with representational compactness.

cs.CL · cs.LG