AI千集
首页热点资讯知识笔记阅读频道关于我们知识库客户端下载
登录
  • 最新
  • 推荐
  • AI医疗
  • AI写作
  • AI应用
  • AI基础
  • AI量化
  • AI数据
  • AI画图
  • AIGC
  • 编程基础
  • 课程演讲
  • 资料仓库
  • 因果学习示例代码与解析

    gingo 2021-08-11 16:44:17 资料仓库
    0 / 1790
  • StyleGAN2-ADA pytorch版本

    gingo 2021-08-11 16:32:52 资料仓库
    0 / 1721
  • Making Toonify Yourself 怎样照片卡通化 - 附网站搭建指南

    gingo 2021-08-10 17:35:53 资料仓库 卡通化图像处理
    0 / 2353
  • some papers

    gingo 2021-08-09 16:48:12 资料仓库
    0 / 1469
  • 因果推理3: 反事实推理(翻译)

    gingo 2021-08-09 14:46:59 资料仓库
    0 / 1677
  • python脚本实现批量更新MYSQL 42万条数据

    openoker 2021-08-06 17:20:35 编程基础 pythonmysql
    0 / 1688
  • 因果推理:试图理解为什么的问题

    gingo 2021-08-06 15:56:45 课程演讲
    0 / 2420
  • 快速的完成百万级MySQL数据迁移

    openoker 2021-08-06 14:26:38 编程基础
    0 / 1498
  • 因果学习资料汇总(zz 整理)

    gingo 2021-08-02 17:29:05 资料仓库 因果学习
    0 / 1747
  • Spark必会知识点

    openoker 2021-07-28 16:19:48 资料仓库
    0 / 2258
  • 贝叶斯之父Judea Pearl 信息--转载

    gingo 2021-07-20 14:20:10 资料仓库
    0 / 1528
  • 视频学习胜过读书吗?

    openoker 2021-07-12 19:55:09 课程演讲 视频学习
    0 / 2009
  • Gif 动图·纪念哈勃望远镜25周年[zz]

    gingo 2021-07-02 09:15:24 AI数据
    0 / 2152
  • PointNet++视频讲解(zz)

    weilaiweiding 2021-06-17 17:46:12 资料仓库
    1
    0 / 1622
  • PointNet与PointNet++:基于深度学习的3D点云分类和分割模型

    weilaiweiding 2021-06-17 17:35:14 资料仓库
    0 / 1639
  • 人物卡通化

    gingo 2021-06-17 16:50:14 资料仓库 图像处理
    0 / 2050
  • 自学编程清单(需要自备梯子)

    openoker 2021-06-12 18:03:08 编程基础 自学教程
    0 / 3461
  • 程序员理财课:Python量化交易系统实战

    Van 2021-06-12 07:18:41 课程演讲 量化交易
    0 / 1829
  • Python股票量化投资课程

    Van 2021-06-12 06:51:24 课程演讲 量化交易
    0 / 1871
  • TensorFlow实战专项课程TensorFlow in Practice Specialization

    weilaiweiding 2021-06-11 17:58:43 课程演讲 Andrew-NgTensorflow自然语言处理
    0 / 1827
  • OpenAI的1亿美元启动基金将与微软成为合作伙伴的"早期大赌注''

    weilaiweiding 2021-05-27 14:27:41 AI应用
    0 / 1830
  • 转-日处理数据量超10亿:友信金服基于Flink构建实时用户画像系统的实践

    weilaiweiding 2021-05-27 12:00:50 编程基础
    0 / 1535
  • StyleGAN network blending

    gingo 2021-05-25 16:04:12 AI画图
    0 / 1988
  • 哈工大讯飞实验室

    weilaiweiding 2021-05-22 15:52:16 资料仓库 实验室
    0 / 2432
  • 服务协议

    openoker 2021-05-18 10:50:03 AI写作 规范
    1
    0 / 1622
  • 积分规则

    openoker 2021-05-18 10:39:21 AI写作 规则
    0 / 2079
  • 使用规范

    openoker 2021-05-18 10:32:52 AI写作 使用规范
    0 / 1888
  • 关于生成对抗网络的开放性问题Open Questions about Generative Adversarial Networks

    gingo 2021-05-17 15:09:17 AI基础
    0 / 1299
  • Embedding技术在房产推荐中的应用

    openoker 2021-05-13 15:04:15 资料仓库 推荐系统Embedding
    0 / 1334
  • 最全推荐系统Embedding召回算法总结

    openoker 2021-05-13 14:57:58 资料仓库 推荐系统Embedding
    0 / 2013
  • 如何解决神经网络训练时loss不下降的问题

    weilaiweiding 2021-05-08 10:59:11 资料仓库 神经网络深度学习
    0 / 1452
  • 训练集、验证集、测试集以及交验验证的理解

    weilaiweiding 2021-05-08 09:34:15 AI数据 机器学习
    0 / 1424
  • AI For Everyone 适用于所有人的人工智能课程(含全集所有中文字幕 )

    weilaiweiding 2021-05-07 17:09:44 课程演讲 零基础AI通俗人工智能吴恩达
    0 / 1898
  • 机器学习的十种基本算法

    weilaiweiding 2021-05-07 16:25:49 资料仓库 机器学习算法
    0 / 1856
  • 机器学习的梯度下降

    gingo 2021-05-07 10:35:15 资料仓库 机器学习
    0 / 1433
  • 从更少的数据中学习对表格进行推理

    icodebase 2021-04-29 17:10:17 资料仓库 迁移学习
    0 / 1416
  • Netflix 推荐系统之个性化主页生成

    icodebase 2021-04-27 17:29:02 资料仓库 推荐系统
    0 / 1657
  • 使用StyleGAN + CLIP从文本生成面部图像[翻译]

    icodebase 2021-04-27 15:52:38 资料仓库
    0 / 1441
  • AlphaTree:Object Detection 物体检测

    gingo 2021-04-27 10:22:55 资料仓库 物体检测
    0 / 1598
  • 100天深度学习 Week2 day12 DPN

    gingo 2021-04-22 14:52:00 AI基础
    0 / 1456
  • Google使用GAN创建怪兽

    weilaiweiding 2021-04-21 15:22:08 AI画图
    0 / 1600
  • Kiva机器人拆解

    weilaiweiding 2021-04-20 17:27:44 机器人
    0 / 1922
  • 亚马逊的仓储机器人

    weilaiweiding 2021-04-20 17:22:06 机器人
    0 / 1467
  • 字节跳动早期商业计划书-2013年by张一鸣

    weilaiweiding 2021-04-20 13:56:53 课程演讲
    0 / 1348
  • AI计划100天-Week1 总结

    gingo 2021-04-17 16:51:05 AI基础
    2
    0 / 1389
  • Yann LeCun2014年早期访谈录-看十年前的学习指南

    gingo 2021-04-13 17:09:04 资料仓库 访谈
    0 / 1325
  • [zz]AI 名人堂,世界人工智能60年60位名人榜

    icodebase 2021-04-13 16:22:56 资料仓库 名人
    0 / 1223
  • 中文语音语料(含百度网盘链接)

    icodebase 2021-04-09 17:07:14 AI数据
    0 / 2015
  • netflix_beyond_5_stars Netflix推荐算法82页课件

    icodebase 2021-04-09 11:18:19 课程演讲
    0 / 1320
  • 100天深度学习--PartA:Week2-day10 DenseNet

    gingo 2021-04-09 09:54:26 AI基础
    0 / 1478
上一页 下一页
  • 4
  • 5
  • 6
  • 7
  • 8
签到
立即签到
签到可以获得积分哦!
公告

AI千集是一个专注于科研服务的智能平台
在这里您可以获得本平台自训练的
科研智能体
和小伙伴一起玩转AI,做自己的AI机器人
来AI千集,赋能智慧快人一步
扫一扫,快速获取解决方案与报价
立即咨询

最新资讯更多
  • Deep Reinforcement learning (DRL) has achieved remarkable success in domains with well-defined reward structures, such as Atari games and locomotion. In contrast, dexterous manipulation lacks general-purpose reward formulations and typically depends on task-specific, handcrafted priors to guide hand-object interactions. We propose Contact Coverage-Guided Exploration (CCGE), a general exploration method designed for general-purpose dexterous manipulation tasks. CCGE represents contact state as the intersection between object surface points and predefined hand keypoints, encouraging dexterous hands to discover diverse and novel contact patterns, namely which fingers contact which object regions. It maintains a contact counter conditioned on discretized object states obtained via learned hash codes, capturing how frequently each finger interacts with different object regions. This counter is leveraged in two complementary ways:(1) to assign a count-based contact coverage reward that promotes exploration of novel contact patterns, and (2) an energy-based reaching reward that guides the agent toward under-explored contact regions. We evaluate CCGE on a diverse set of dexterous manipulation tasks, including cluttered object singulation, constrained object retrieval, in-hand reorientation, and bimanual manipulation. Experimental results show that CCGE substantially improves training efficiency and success rates over existing exploration methods, and that the contact patterns learned with CCGE transfer robustly to real-world robotic systems. Project page is
    喜欢 0    评论 0
  • Vision Language Models (VLMs) exhibit persistent hallucinations in counting tasks, with accuracy substantially lower than other visual reasoning tasks (excluding sentiment). This phenomenon persists even in state-of-the-art reasoning-capable VLMs. Conversely, CNN-based object detection models (ODMs) such as YOLO excel at spatial localization and instance counting with minimal computational overhead. We propose GroundCount, a framework that augments VLMs with explicit spatial grounding from ODMs to mitigate counting hallucinations. In the best case, our prompt-based augmentation strategy achieves 81.3% counting accuracy on the best-performing model (Ovis2.5-2B) - a 6.6pp improvement - while reducing inference time by 22% through elimination of hallucination-driven reasoning loops for stronger models. We conduct comprehensive ablation studies demonstrating that positional encoding is a critical component, being beneficial for stronger models but detrimental for weaker ones. Confidence scores, by contrast, introduce noise for most architectures and their removal improves performance in four of five evaluated models. We further evaluate feature-level fusion architectures, finding that explicit symbolic grounding via structured prompts outperforms implicit feature fusion despite sophisticated cross-attention mechanisms. Our approach yields consistent improvements across four of five evaluated VLM architectures (6.2--7.5pp), with one architecture exhibiting degraded performance due to incompatibility between its iterative reflection mechanisms and structured prompts. These results suggest that counting failures stem from fundamental spatial-semantic integration limitations rather than architecture-specific deficiencies, while highlighting the importance of architectural compatibility in augmentation strategies.
    喜欢 0    评论 0
  • The rapid evolution and inherent complexity of modern software requirements demand highly flexible and responsive development methodologies. While Agile frameworks have become the industry standard for prioritizing iteration, collaboration, and adaptability, software development teams continue to face persistent challenges in managing constantly evolving requirements and maintaining product quality under tight deadlines. This article explores the intersection of Artificial Intelligence (AI) and Software Engineering (SE), to analyze how AI serves as a powerful catalyst for enhancing agility and fostering innovation. The research combines a comprehensive review of existing literature with an empirical study, utilizing a survey directed at Software Engineering professionals to assess the perception, adoption, and impact of AI-driven tools. Key findings reveal that the integration of AI (specifically through Machine Learning (ML) and Natural Language Processing (NLP) )facilitates the automation of tedious tasks, from requirement management to code generation and testing . This paper demonstrates that AI not only optimizes current Agile practices but also introduces new capabilities essential for sustaining quality, speed, and innovation in the future landscape of software development.
    喜欢 0    评论 0
  • Human uplift studies - or studies that measure AI effects on human performance relative to a status quo, typically using randomized controlled trial (RCT) methodology - are increasingly used to inform deployment, governance, and safety decisions for frontier AI systems. While the methods underlying these studies are well-established, their interaction with the distinctive properties of frontier AI systems remains underexamined, particularly when results are used to inform high-stakes decisions. We present findings from interviews with 16 expert practitioners with experience conducting human uplift studies in domains including biosecurity, cybersecurity, education, and labor. Across interviews, experts described a recurring tension between standard causal inference assumptions and the object of study itself. Rapidly evolving AI systems, shifting baselines, heterogeneous and changing user proficiency, and porous real-world settings strain assumptions underlying internal, external, and construct validity, complicating the interpretation and appropriate use of uplift evidence. We synthesize these challenges across key stages of the human uplift research lifecycle and map them to practitioner-reported solutions, clarifying both the limits and the appropriate uses of evidence from human uplift studies in high-stakes decision-making.
    喜欢 0    评论 0
  • VLMs have become increasingly proficient at a range of computer vision tasks, such as visual question answering and object detection. This includes increasingly strong capabilities in the domain of art, from analyzing artwork to generation of art. In an interdisciplinary collaboration between computer scientists and art historians, we characterize the mechanisms underlying VLMs' ability to predict artistic style and assess the extent to which they align with the criteria art historians use to reason about artistic style. We employ a latent-space decomposition approach to identify concepts that drive art style prediction and conduct quantitative evaluations, causal analysis and assessment by art historians. Our findings indicate that 73% of the extracted concepts are judged by art historians to exhibit a coherent and semantically meaningful visual feature and 90% of concepts used to predict style of a given artwork were judged relevant. In cases where an irrelevant concept was used to successfully predict style, art historians identified possible reasons for its success; for example, the model might "understand" a concept in more formal terms, such as dark/light contrasts.
    喜欢 0    评论 0
  • We present IsalGraph, a method for representing the structure of any finite, simple graph as a compact string over a nine-character instruction alphabet. The encoding is executed by a small virtual machine comprising a sparse graph, a circular doubly-linked list (CDLL) of graph-node references, and two traversal pointers. Instructions either move a pointer through the CDLL or insert a node or edge into the graph. A key design property is that every string over the alphabet decodes to a valid graph, with no invalid states reachable. A greedy \emph{GraphToString} algorithm encodes any connected graph into a string in time polynomial in the number of nodes; an exhaustive-backtracking variant produces a canonical string by selecting the lexicographically smallest shortest string across all starting nodes and all valid traversal orders. We evaluate the representation on five real-world graph benchmark datasets (IAM Letter LOW/MED/HIGH, LINUX, and AIDS) and show that the Levenshtein distance between IsalGraph strings correlates strongly with graph edit distance (GED). Together, these properties make IsalGraph strings a compact, isomorphism-invariant, and language-model-compatible sequential encoding of graph structure, with direct applications in graph similarity search, graph generation, and graph-conditioned language modelling
    喜欢 0    评论 0
积分排行
  • gingo

    104 帖子 • 8 评论

    1431
  • 137****0631

    0 帖子 • 0 评论

    997
  • weilaiweiding

    52 帖子 • 1 评论

    821
  • icodebase

    59 帖子 • 1 评论

    528
  • openoker

    171 帖子 • 23 评论

    298
  • 188****2791

    0 帖子 • 0 评论

    180
  • boatingman

    0 帖子 • 1 评论

    90
  • toc

    0 帖子 • 0 评论

    60
  • Van

    3 帖子 • 0 评论

    42
  • shadow

    5 帖子 • 0 评论

    28
友情链接 查看更多>>
  • 导航

    打造最强静态导航网站

  • 135AI排版

    公众号智能文案生成与自动排版工具

  • 二次元数字人视频生成平台

    二次元数字人视频生成平台

关于 标签 友链
粤ICP备18152112号 网信算备330110507206401230035号 粤公网安备44030302001590号 © 2018-2025 AI千集 All Rights Reserved