Daily Arxiv

전 세계에서 발간되는 인공지능 관련 논문을 정리하는 페이지 입니다.
본 페이지는 Google Gemini를 활용해 요약 정리하며, 비영리로 운영 됩니다.
논문에 대한 저작권은 저자 및 해당 기관에 있으며, 공유 시 출처만 명기하면 됩니다.

CoRT: Code-integrated Reasoning within Thinking

TransXSSM: A Hybrid Transformer State Space Model with Unified Rotary Position Embedding

Policy-Based Trajectory Clustering in Offline Reinforcement Learning

Understanding Human-AI Trust in Education

ConfPO: Exploiting Policy Model Confidence for Critical Token Selection in Preference Optimization

MasHost Builds It All: Autonomous Multi-Agent System Directed by Reinforcement Learning

CheMatAgent: Enhancing LLMs for Chemistry and Materials Science through Tree-Search Based Tool Learning

DeepVideo-R1: Video Reinforcement Fine-Tuning via Difficulty-aware Regressive GRPO

Robotic Policy Learning via Human-assisted Action Preference Optimization

LLM-D12: A Dual-Dimensional Scale of Instrumental and Relational Dependencies on Large Language Models

QuantMCP: Grounding Large Language Models in Verifiable Financial Reality

Future of Work with AI Agents: Auditing Automation and Augmentation Potential across the U.S. Workforce

Multi-Modal Multi-Task Federated Foundation Models for Next-Generation Extended Reality Systems: Towards Privacy-Preserving Distributed Intelligence in AR/VR/MR

Peer-Ranked Precision: Creating a Foundational Dataset for Fine-Tuning Vision Models from DataSeeds' Annotated Imagery

Q-Ponder: A Unified Training Pipeline for Reasoning-based Visual Quality Assessment

Sample Complexity and Representation Ability of Test-time Scaling Paradigms

Context Is Not Comprehension

High Performance Space Debris Tracking in Complex Skylight Backgrounds with a Large-Scale Dataset

SALAD: Systematic Assessment of Machine Unlearing on LLM-Aided Hardware Design

iQUEST: An Iterative Question-Guided Framework for Knowledge Base Question Answering

Incentivizing Reasoning for Advanced Instruction-Following of Large Language Models

SealQA: Raising the Bar for Reasoning in Search-Augmented Language Models

Subgraph Gaussian Embedding Contrast for Self-Supervised Graph Representation Learning

Quantum AIXI: Universal Intelligence via Quantum Information

VTool-R1: VLMs Learn to Think with Images via Reinforcement Learning on Multimodal Tool Use

Qronos: Correcting the Past by Shaping the Future... in Post-Training Quantization

QuXAI: Explainers for Hybrid Quantum Machine Learning Models

Convert Language Model into a Value-based Strategic Planner

PhysNav-DG: A Novel Adaptive Framework for Robust VLM-Sensor Fusion in Navigation Applications

Token-Efficient RL for LLM Reasoning

MAYA: Addressing Inconsistencies in Generative Password Guessing through a Unified Benchmark

Elucidating the Design Space of Multimodal Protein Language Models

A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce

On the Geometry of Receiver Operating Characteristic and Precision-Recall Curves

Expert Race: A Flexible Routing Strategy for Scaling Diffusion Transformer with Mixture of Experts

Content ARCs: Decentralized Content Rights in the Age of Generative AI

PLAY2PROMPT: Zero-shot Tool Instruction Optimization for LLM Agents via Tool Play

Computation Mechanism Behind LLM Position Generalization

CompMarkGS: Robust Watermarking for Compressed 3D Gaussian Splatting

Large Language Models for Outpatient Referral: Problem Definition, Benchmarking and Challenges

Social Bias Benchmark for Generation: A Comparison of Generation and QA-Based Evaluations

An energy-efficient learning solution for the Agile Earth Observation Satellite Scheduling Problem

Generative Uncertainty in Diffusion Models

EgoNormia: Benchmarking Physical Social Norm Understanding

Obliviate: Efficient Unmemorization for Protecting Intellectual Property in Large Language Models

From Features to Graphs: Exploring Graph Structures and Pairwise Interactions via GNNs

Object-Centric Latent Action Learning

Quality over Quantity: Boosting Data Efficiency Through Ensembled Multimodal Data Curation

TransMLA: Multi-Head Latent Attention Is All You Need

Implicit Language Models are RNNs: Balancing Parallelization and Expressivity

Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty

Prompt-based Depth Pruning of Large Language Models

Great Models Think Alike and this Undermines AI Oversight

Upweighting Easy Samples in Fine-Tuning Mitigates Forgetting

Latent Action Learning Requires Supervision in the Presence of Distractors

SR-Reward: Taking The Path More Traveled

Heterogeneous Multi-Agent Reinforcement Learning for Distributed Channel Access in WLANs

SoK: Watermarking for AI-Generated Content

Engagement-Driven Content Generation with Large Language Models

PyGen: A Collaborative Human-AI Approach to Python Package Creation

DAWN: Designing Distributed Agents in a Worldwide Network

Efficient Length-Generalizable Attention via Causal Retrieval for Long-Context Language Modeling

Center-fixing of tropical cyclones using uncertainty-aware deep learning applied to high-temporal-resolution geostationary satellite imagery

LLM-Cure: LLM-based Competitor User Review Analysis for Feature Enhancement

Deploying Open-Source Large Language Models: A performance Analysis

Neural Networks Generalize on Low Complexity Data

M3-JEPA: Multimodal Alignment via Multi-gate MoE based on the Joint-Predictive Embedding Architecture

Paired Completion: Flexible Quantification of Issue-framing at Scale with LLMs

The Fellowship of the LLMs: Multi-Agent Workflows for Synthetic Preference Optimization Dataset Generation

TimeBridge: Better Diffusion Prior Design with Bridge Models for Time Series Generation

Multi-group Uncertainty Quantification for Long-form Text Generation

Hey, That's My Model! Introducing Chain & Hash, An LLM Fingerprinting Technique

Privacy-Aware Spectrum Pricing and Power Control Optimization for LEO Satellite Internet-of-Things

IndoToxic2024: A Demographically-Enriched Dataset of Hate Speech and Toxicity Types for Indonesian Language

Incentivizing Quality Text Generation via Statistical Contracts

Visually Descriptive Language Model for Vector Graphics Reasoning

Securing Large Language Models: Threats, Vulnerabilities and Responsible Practices

Mitigating Object Hallucination in Large Vision-Language Models via Image-Grounded Guidance

Near-Optimal Algorithms for Constrained k-Center Clustering with Instance-level Background Knowledge

IoTGeM: Generalizable Models for Behaviour-Based IoT Attack Detection

Improved Algorithm for Deep Active Learning under Imbalance via Optimal Separation

ConvD: Attention Enhanced Dynamic Convolutional Embeddings for Knowledge Graph Completion

Noise Balance and Stationary Distribution of Stochastic Gradient Descent

The Packing Chromatic Number of the Infinite Square Grid is 15

Reinforcing Multimodal Understanding and Generation with Dual Self-rewards

A Proposal to Extend the Common Model of Cognition with Metacognition

The Optimization Paradox in Clinical AI Multi-Agent Systems

CHANCERY: Evaluating Corporate Governance Reasoning Capabilities in Language Models

DeePoly: A High-Order Accuracy Scientific Machine Learning Framework for Function Approximation and Solving PDE

Beamforming and Resource Allocation for Delay Optimization in RIS-Assisted OFDM Systems

Evaluation of LLMs for mathematical problem solving

The Automated but Risky Game: Modeling Agent-to-Agent Negotiations and Transactions in Consumer Markets

A Heuristic Algorithm Based on Beam Search and Iterated Local Search for the Maritime Inventory Routing Problem

A Vision for Auto Research with LLM Agents

AssistanceZero: Scalably Solving Assistance Games

Don't Lag, RAG: Training-Free Adversarial Detection Using RAG

Wider or Deeper? Scaling LLM Inference-Time Compute with Adaptive Branching Tree Search

Training-Free Safe Denoisers for Safe Use of Diffusion Models

CollabLLM: From Passive Responders to Active Collaborators

Position: Theory of Mind Benchmarks are Broken for Large Language Models

The Packing Chromatic Number of the Infinite Square Grid is 15

Created by

Haebom

저자

Bernardo Subercaseaux, Marijn J. H. Heule

개요

무한대 정사각형 격자의 패킹 채색 수를 결정하는 것은 2002년 제시된 이후 미해결 문제였습니다. 본 논문은 이 문제에 대한 답으로 패킹 채색 수가 15임을 증명합니다. 이는 기존 최고 성능 방법보다 약 100배 향상된 결과이며, 새로운 제약 조건 인코딩 및 대칭성 깨기 방법을 통해 달성되었습니다. 새로운 방법들의 정확성 검증을 위해 불만족 증명을 이용하여 신뢰할 수 있는 핵심 부분을 직접 인코딩의 정확성으로 축소하였습니다.

시사점, 한계점

•

시사점: 무한대 정사각형 격자의 패킹 채색 수 문제를 15라는 값으로 해결, 기존 알고리즘 성능을 크게 향상시키는 새로운 제약 조건 인코딩 및 대칭성 깨기 방법 제시.

•

한계점: 새로운 방법들의 복잡성으로 인해, 방법의 정확성 검증에 대한 의존성이 존재 (직접 인코딩의 정확성에 의존).

Made with Slashpage