<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Artificial Intelligence on Jaehun's Blog</title><link>https://jaehun.me/tags/artificial-intelligence/</link><description>Recent content in Artificial Intelligence on Jaehun's Blog</description><generator>Hugo</generator><language>ko-kr</language><lastBuildDate>Sun, 13 Sep 2026 09:29:41 +0900</lastBuildDate><atom:link href="https://jaehun.me/tags/artificial-intelligence/index.xml" rel="self" type="application/rss+xml"/><item><title>Marigold V2: Revisiting Diffusion Transformers for Monocular Depth Estimation</title><link>https://jaehun.me/posts/marigold-v2-revisiting-diffusion-transformers-for-monocular-depth-estimation/</link><pubDate>Sun, 13 Sep 2026 00:00:00 +0900</pubDate><guid>https://jaehun.me/posts/marigold-v2-revisiting-diffusion-transformers-for-monocular-depth-estimation/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2609.08084"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;논문 링크&lt;svg class="h-3 w-3 flex-shrink-0" id="external-link" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M15 3h6v6m-11 5L21 3m-3 10v6a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2V8a2 2 0 0 1 2-2h6"/&gt;&lt;/svg&gt;&#10; &lt;/a&gt;&lt;/p&gt;&#10;&lt;h2 id="marigold-v2-이미지-편집-확산-트랜스포머dit를-단안-깊이-추정기로-되살리기"&gt;Marigold V2: 이미지 편집 확산 트랜스포머(DiT)를 단안 깊이 추정기로 되살리기&lt;a href="#marigold-v2-%ec%9d%b4%eb%af%b8%ec%a7%80-%ed%8e%b8%ec%a7%91-%ed%99%95%ec%82%b0-%ed%8a%b8%eb%9e%9c%ec%8a%a4%ed%8f%ac%eb%a8%b8dit%eb%a5%bc-%eb%8b%a8%ec%95%88-%ea%b9%8a%ec%9d%b4-%ec%b6%94%ec%a0%95%ea%b8%b0%eb%a1%9c-%eb%90%98%ec%82%b4%eb%a6%ac%ea%b8%b0" class="heading-anchor" aria-label="이 섹션에 대한 링크"&gt;&lt;svg class="h-4 w-4" aria-hidden="true" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;g fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2"&gt;&lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"/&gt;&lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"/&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/h2&gt;&lt;h2 id="한-줄-요약-tldr"&gt;한 줄 요약 (TL;DR)&lt;a href="#%ed%95%9c-%ec%a4%84-%ec%9a%94%ec%95%bd-tldr" class="heading-anchor" aria-label="이 섹션에 대한 링크"&gt;&lt;svg class="h-4 w-4" aria-hidden="true" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;g fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2"&gt;&lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"/&gt;&lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"/&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Qwen-Image-Edit-2509라는 **이미지 편집용 확산 트랜스포머(DiT)**를 4-bit QLoRA로 파인튜닝해, &lt;strong&gt;단일 32GB GPU에서 약 1주일 만에&lt;/strong&gt; 단안 깊이 추정 SOTA를 달성한 연구다. 핵심은 두 가지 새로운 손실 — 깊이 GT에서 뽑은 의미 특징과 정렬하는 &lt;strong&gt;iREPA-depth&lt;/strong&gt;, 그리고 최적 수송(Sinkhorn) 기반의 &lt;strong&gt;SinkLoss&lt;/strong&gt; — 이며, 털·잎사귀·머리카락 같은 미세 디테일까지 살리면서 비행 픽셀(flying pixel) 아티팩트를 억제한다.&lt;/p&gt;</description></item><item><title>Bridging the Safety Gap: A Guardrail Pipeline for Trustworthy LLM Inferences</title><link>https://jaehun.me/posts/bridging-the-safety-gap-a-guardrail-pipeline-for-trustworthy-llm-inferences/</link><pubDate>Tue, 04 Mar 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/posts/bridging-the-safety-gap-a-guardrail-pipeline-for-trustworthy-llm-inferences/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2502.08142v1"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;논문 링크&lt;svg class="h-3 w-3 flex-shrink-0" id="external-link" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M15 3h6v6m-11 5L21 3m-3 10v6a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2V8a2 2 0 0 1 2-2h6"/&gt;&lt;/svg&gt;&#10; &lt;/a&gt;&lt;/p&gt;&#10;&lt;h1 id="q--이-논문을-아주-자세하게-읽고-논문의-강점과-독창적인-지점을-설명해주고-핵심-알고리즘을-예시-입력을-들어서-전체적인-과정을-설명해줘-추가적으로-논문의-한계점에-대해서도-알려줘"&gt;Q : 이 논문을 아주 자세하게 읽고 논문의 강점과 독창적인 지점을 설명해주고 핵심 알고리즘을 예시 입력을 들어서 전체적인 과정을 설명해줘 추가적으로 논문의 한계점에 대해서도 알려줘&lt;a href="#q--%ec%9d%b4-%eb%85%bc%eb%ac%b8%ec%9d%84-%ec%95%84%ec%a3%bc-%ec%9e%90%ec%84%b8%ed%95%98%ea%b2%8c-%ec%9d%bd%ea%b3%a0-%eb%85%bc%eb%ac%b8%ec%9d%98-%ea%b0%95%ec%a0%90%ea%b3%bc-%eb%8f%85%ec%b0%bd%ec%a0%81%ec%9d%b8-%ec%a7%80%ec%a0%90%ec%9d%84-%ec%84%a4%eb%aa%85%ed%95%b4%ec%a3%bc%ea%b3%a0-%ed%95%b5%ec%8b%ac-%ec%95%8c%ea%b3%a0%eb%a6%ac%ec%a6%98%ec%9d%84-%ec%98%88%ec%8b%9c-%ec%9e%85%eb%a0%a5%ec%9d%84-%eb%93%a4%ec%96%b4%ec%84%9c-%ec%a0%84%ec%b2%b4%ec%a0%81%ec%9d%b8-%ea%b3%bc%ec%a0%95%ec%9d%84-%ec%84%a4%eb%aa%85%ed%95%b4%ec%a4%98-%ec%b6%94%ea%b0%80%ec%a0%81%ec%9c%bc%eb%a1%9c-%eb%85%bc%eb%ac%b8%ec%9d%98-%ed%95%9c%ea%b3%84%ec%a0%90%ec%97%90-%eb%8c%80%ed%95%b4%ec%84%9c%eb%8f%84-%ec%95%8c%eb%a0%a4%ec%a4%98" class="heading-anchor" aria-label="이 섹션에 대한 링크"&gt;&lt;svg class="h-4 w-4" aria-hidden="true" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;g fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2"&gt;&lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"/&gt;&lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"/&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/h1&gt;&lt;h3 id="논문의-핵심-요약-및-기여점"&gt;논문의 핵심 요약 및 기여점&lt;a href="#%eb%85%bc%eb%ac%b8%ec%9d%98-%ed%95%b5%ec%8b%ac-%ec%9a%94%ec%95%bd-%eb%b0%8f-%ea%b8%b0%ec%97%ac%ec%a0%90" class="heading-anchor" aria-label="이 섹션에 대한 링크"&gt;&lt;svg class="h-4 w-4" aria-hidden="true" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;g fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2"&gt;&lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"/&gt;&lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"/&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;&lt;strong&gt;논문 제목:&lt;/strong&gt; &lt;em&gt;Bridging the Safety Gap: A Guardrail Pipeline for Trustworthy LLM Inferences&lt;/em&gt;&lt;br&gt;&#10;&lt;strong&gt;핵심 내용:&lt;/strong&gt;&lt;br&gt;&#10;이 논문은 &lt;em&gt;Wildflare GuardRail&lt;/em&gt;이라는 프레임워크를 제안하여 대형 언어 모델(LLM)의 안전성과 신뢰성을 향상시키는 시스템을 개발했다. LLM의 주요 문제점인 &lt;strong&gt;비허용 콘텐츠 탐지, 환각(hallucination), 편향성(bias), 악성 URL 삽입 등의 보안 위험을 감지하고 수정하는 파이프라인&lt;/strong&gt;을 구축하는 것이 핵심 목표다.&lt;/p&gt;</description></item><item><title>DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Data</title><link>https://jaehun.me/posts/deepseek-prover-advancing-theorem-proving-in-llms-through-large-scale-synthetic-data/</link><pubDate>Sun, 09 Feb 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/posts/deepseek-prover-advancing-theorem-proving-in-llms-through-large-scale-synthetic-data/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2405.14333v1"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;논문 링크&lt;svg class="h-3 w-3 flex-shrink-0" id="external-link" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M15 3h6v6m-11 5L21 3m-3 10v6a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2V8a2 2 0 0 1 2-2h6"/&gt;&lt;/svg&gt;&#10; &lt;/a&gt;&lt;/p&gt;&#10;&lt;h1 id="q--이-논문을-아주-자세하게-읽고-논문의-강점과-독창적인-지점을-설명해주고-핵심-알고리즘을-예시-입력을-들어서-전체적인-과정을-설명해줘-추가적으로-논문의-한계점에-대해서도-알려줘"&gt;Q : 이 논문을 아주 자세하게 읽고 논문의 강점과 독창적인 지점을 설명해주고 핵심 알고리즘을 예시 입력을 들어서 전체적인 과정을 설명해줘 추가적으로 논문의 한계점에 대해서도 알려줘&lt;a href="#q--%ec%9d%b4-%eb%85%bc%eb%ac%b8%ec%9d%84-%ec%95%84%ec%a3%bc-%ec%9e%90%ec%84%b8%ed%95%98%ea%b2%8c-%ec%9d%bd%ea%b3%a0-%eb%85%bc%eb%ac%b8%ec%9d%98-%ea%b0%95%ec%a0%90%ea%b3%bc-%eb%8f%85%ec%b0%bd%ec%a0%81%ec%9d%b8-%ec%a7%80%ec%a0%90%ec%9d%84-%ec%84%a4%eb%aa%85%ed%95%b4%ec%a3%bc%ea%b3%a0-%ed%95%b5%ec%8b%ac-%ec%95%8c%ea%b3%a0%eb%a6%ac%ec%a6%98%ec%9d%84-%ec%98%88%ec%8b%9c-%ec%9e%85%eb%a0%a5%ec%9d%84-%eb%93%a4%ec%96%b4%ec%84%9c-%ec%a0%84%ec%b2%b4%ec%a0%81%ec%9d%b8-%ea%b3%bc%ec%a0%95%ec%9d%84-%ec%84%a4%eb%aa%85%ed%95%b4%ec%a4%98-%ec%b6%94%ea%b0%80%ec%a0%81%ec%9c%bc%eb%a1%9c-%eb%85%bc%eb%ac%b8%ec%9d%98-%ed%95%9c%ea%b3%84%ec%a0%90%ec%97%90-%eb%8c%80%ed%95%b4%ec%84%9c%eb%8f%84-%ec%95%8c%eb%a0%a4%ec%a4%98" class="heading-anchor" aria-label="이 섹션에 대한 링크"&gt;&lt;svg class="h-4 w-4" aria-hidden="true" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;g fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2"&gt;&lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"/&gt;&lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"/&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;논문의 강점 및 독창적인 지점&lt;/p&gt;</description></item><item><title>DeepSeek-VL: Towards Real-World Vision-Language Understanding</title><link>https://jaehun.me/posts/deepseek-vl-towards-real-world-vision-language-understanding/</link><pubDate>Sun, 09 Feb 2025 00:00:00 +0900</pubDate><guid>https://jaehun.me/posts/deepseek-vl-towards-real-world-vision-language-understanding/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2403.05525v2"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;논문 링크&lt;svg class="h-3 w-3 flex-shrink-0" id="external-link" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M15 3h6v6m-11 5L21 3m-3 10v6a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2V8a2 2 0 0 1 2-2h6"/&gt;&lt;/svg&gt;&#10; &lt;/a&gt;&lt;/p&gt;&#10;&lt;h1 id="q--이-논문을-아주-자세하게-읽고-논문의-강점과-독창적인-지점을-설명해주고-핵심-알고리즘을-예시-입력을-들어서-전체적인-과정을-설명해줘-추가적으로-논문의-한계점에-대해서도-알려줘"&gt;Q : 이 논문을 아주 자세하게 읽고 논문의 강점과 독창적인 지점을 설명해주고 핵심 알고리즘을 예시 입력을 들어서 전체적인 과정을 설명해줘 추가적으로 논문의 한계점에 대해서도 알려줘&lt;a href="#q--%ec%9d%b4-%eb%85%bc%eb%ac%b8%ec%9d%84-%ec%95%84%ec%a3%bc-%ec%9e%90%ec%84%b8%ed%95%98%ea%b2%8c-%ec%9d%bd%ea%b3%a0-%eb%85%bc%eb%ac%b8%ec%9d%98-%ea%b0%95%ec%a0%90%ea%b3%bc-%eb%8f%85%ec%b0%bd%ec%a0%81%ec%9d%b8-%ec%a7%80%ec%a0%90%ec%9d%84-%ec%84%a4%eb%aa%85%ed%95%b4%ec%a3%bc%ea%b3%a0-%ed%95%b5%ec%8b%ac-%ec%95%8c%ea%b3%a0%eb%a6%ac%ec%a6%98%ec%9d%84-%ec%98%88%ec%8b%9c-%ec%9e%85%eb%a0%a5%ec%9d%84-%eb%93%a4%ec%96%b4%ec%84%9c-%ec%a0%84%ec%b2%b4%ec%a0%81%ec%9d%b8-%ea%b3%bc%ec%a0%95%ec%9d%84-%ec%84%a4%eb%aa%85%ed%95%b4%ec%a4%98-%ec%b6%94%ea%b0%80%ec%a0%81%ec%9c%bc%eb%a1%9c-%eb%85%bc%eb%ac%b8%ec%9d%98-%ed%95%9c%ea%b3%84%ec%a0%90%ec%97%90-%eb%8c%80%ed%95%b4%ec%84%9c%eb%8f%84-%ec%95%8c%eb%a0%a4%ec%a4%98" class="heading-anchor" aria-label="이 섹션에 대한 링크"&gt;&lt;svg class="h-4 w-4" aria-hidden="true" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;g fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2"&gt;&lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"/&gt;&lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"/&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;논문의 강점과 독창적인 지점&lt;/p&gt;</description></item><item><title>RAG4ITOps A Supervised Fine-Tunable and Comprehensive RAG Framework for IT Operations and Maintenance</title><link>https://jaehun.me/posts/rag4itops-a-supervised-fine-tunable-and-comprehensive-rag-framework-for-it-operations-and-maintenance/</link><pubDate>Mon, 11 Nov 2024 00:00:00 +0900</pubDate><guid>https://jaehun.me/posts/rag4itops-a-supervised-fine-tunable-and-comprehensive-rag-framework-for-it-operations-and-maintenance/</guid><description>&lt;p&gt;논문 : &lt;a&#10; href="https://arxiv.org/abs/2410.15805v1"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;https://arxiv.org/abs/2410.15805v1&lt;svg class="h-3 w-3 flex-shrink-0" id="external-link" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M15 3h6v6m-11 5L21 3m-3 10v6a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2V8a2 2 0 0 1 2-2h6"/&gt;&lt;/svg&gt;&#10; &lt;/a&gt;&lt;/p&gt;&#10;&lt;p&gt;아래글은 Scholar GPT와 대화를 나눈 내용입니다.&lt;/p&gt;&#10;&lt;h1 id="q--논문의-핵심-내용과-강점-알고리즘-설명-그리고-한계점"&gt;Q : 논문의 핵심 내용과 강점, 알고리즘 설명, 그리고 한계점&lt;a href="#q--%eb%85%bc%eb%ac%b8%ec%9d%98-%ed%95%b5%ec%8b%ac-%eb%82%b4%ec%9a%a9%ea%b3%bc-%ea%b0%95%ec%a0%90-%ec%95%8c%ea%b3%a0%eb%a6%ac%ec%a6%98-%ec%84%a4%eb%aa%85-%ea%b7%b8%eb%a6%ac%ea%b3%a0-%ed%95%9c%ea%b3%84%ec%a0%90" class="heading-anchor" aria-label="이 섹션에 대한 링크"&gt;&lt;svg class="h-4 w-4" aria-hidden="true" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;g fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2"&gt;&lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"/&gt;&lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"/&gt;&lt;/g&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/h1&gt;&lt;p&gt;이 논문 **&amp;ldquo;RAG4ITOps: A Supervised Fine-Tunable and Comprehensive RAG Framework for IT Operations and Maintenance&amp;rdquo;**는 IT 운영 및 유지보수를 위한 질의응답(QA) 시스템을 개선하기 위한 &lt;strong&gt;Retrieval-Augmented Generation (RAG)&lt;/strong&gt; 프레임워크인 RAG4ITOps를 제안합니다. 다음은 논문의 강점, 독창성, 핵심 알고리즘 예시, 그리고 한계점에 대한 설명입니다.&lt;/p&gt;</description></item></channel></rss>