Résultats de la recherche - coding ((algorithmics OR algorithmicsics) OR (algorithm OR (algorithm OR algorithm)))

Proxy Discrimination After Students for Fair Admissions par Fagan, Frank

Table des matières: “… accuracy rates, but one uses zip code and the other does not, then the second algorithm can be said to have…”
Accéder au texte intégral

Efficiently Vectorized MCMC on Modern Accelerators par Dance, Hugh, Glaser, Pierre, Orbanz, Peter, Adams, Ryan

Table des matières: “… MCMC algorithms is often now as simple as invoking those tools on single-chain code. Whilst convenient…”
Accéder au texte intégral

RankEvolve: Automating the Discovery of Retrieval Algorithms via LLM-Driven Evolution par Nian, Jinming, Li, Fangchen, Park, Dae Hoon, Fang, Yi

Table des matières: “… based on AlphaEvolve, in which candidate ranking algorithms are represented as executable code…”
Accéder au texte intégral

Partitioning Unstructured Sparse Tensor Algebra for Load-Balanced Parallel Execution par Chougule, Atharva, Root, Alexander J, Lacouture, Rubens, Yan, Bobby, Yadav, Rohan, Kjolstad, Fredrik

Table des matières: “… algorithm that provably load balances the computation of any sparse tensor algebra expression across…”
Accéder au texte intégral

Iterative Linear Quadratic Optimization for Nonlinear Control: Differentiable Programming Algorithmic Templates par Roulet, Vincent, Srinivasa, Siddhartha, Fazel, Maryam, Harchaoui, Zaid

Table des matières: “…Iterative optimization algorithms depend on access to information about the objective function…”
Accéder au texte intégral

RLLTE: Long-Term Evolution Project of Reinforcement Learning par Yuan, Mingqi, Zhang, Zequn, Xu, Yang, Luo, Shihao, Li, Bo, Jin, Xin, Zeng, Wenjun

Table des matières: “… for reinforcement learning (RL) research and application. Beyond delivering top-notch algorithm implementations…”
Accéder au texte intégral

Walking Your Frog Fast in 4 LoC par Meinert, Nis

Table des matières: “… quadratic runtime overhead. However, this algorithm relies on recursions and is not well suited for modern…”
Accéder au texte intégral

Robust Reinforcement Learning from Human Feedback for Large Language Models Fine-Tuning par Ye, Kai, Zhou, Hongyi, Zhu, Jin, Quinzan, Francesco, Shi, Chengchun

Table des matières: “… existing RLHF algorithms use the Bradley-Terry model, which relies on assumptions about human preferences…”
Accéder au texte intégral

Efficient Layered New Bit-Flipping QC-MDPC Decoder for BIKE Post-Quantum Cryptography par Cai, Jiaxuan, Zhang, Xinmiao

Table des matières: “…The medium-density parity-check (MDPC) code-based Bit Flipping Key Encapsulation (BIKE) mechanism…”
Accéder au texte intégral

Linear Complexity Computation of Code Distance and Minimum Size of Trapping Sets for LDPC Codes with Bounded Treewidth par Peng, Qingqing, Liu, Ke, Yan, Guiying, Wang, Guanghui

Table des matières: “…\) in a binary linear code is NP-hard. In this paper, we demonstrate that this problem can be solved…”
Accéder au texte intégral

Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes par Berman, Amit, Shany, Yaron, Tamo, Itzhak

Table des matières: “…We present $O(m^3)$ algorithms for specifying the support of minimum-weight words of extended…”
Accéder au texte intégral

The Challenges for Pharmacoepidemiologists Identifying Migraine in Electronic Healthcare Data Sources: A Systematic Literature Review par Joan Forns, Alicia Abellan, Nuria Riera‐Guàrdia, Andrea V. Margulis, Elena Rivero‐Ferrer

Table des matières: “… depend on algorithm characteristics and target population. Methods To describe migraine‐identifying…”
Accéder au texte intégral

BEAM: Bi-level Memory-adaptive Algorithmic Evolution for LLM-Powered Heuristic Design par Xiang, Chuyang, Wei, Yichen, Ma, Jiale, Wang, Handing, Yan, Junchi

Table des matières: “… complex code through iterative local modifications, they still lack a high-level algorithmic modeling…”
Accéder au texte intégral

Algorithmic Universality, Low-Degree Polynomials, and Max-Cut in Sparse Random Graphs par Cheairi, Houssam El, Gamarnik, David

Table des matières: “… on sparse graphs, provided that an algorithm can be coded as a low-degree polynomial (LDP). We illustrate…”
Accéder au texte intégral

IM-IAD: Industrial Image Anomaly Detection Benchmark in Manufacturing par Xie, Guoyang, Wang, Jinbao, Liu, Jiaqi, Lyu, Jiayi, Liu, Yong, Wang, Chengjie, Zheng, Feng, Jin, Yaochu

Table des matières: “… manufacturing (IM). Recently, many advanced algorithms have been reported, but their performance deviates…”
Accéder au texte intégral

Are Language Models Puzzle Prodigies? Algorithmic Puzzles Unveil Serious Challenges in Multimodal Reasoning par Ghosal, Deepanway, Han, Vernon Toh Yan, Ken, Chia Yew, Poria, Soujanya

Table des matières: “… the capabilities of multimodal language models in solving algorithmic puzzles that necessitate both visual…”
Accéder au texte intégral

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs par Hsieh, Chou-Ying, Lin, Po-Chieh, Kuo, Sy-Yen

Table des matières: “…The push-relabel algorithm is an efficient algorithm that solves the maximum flow/ minimum cut…”
Accéder au texte intégral

Can Large Language Models Invent Algorithms to Improve Themselves?: Algorithm Discovery for Recursive Self-Improvement through Reinforcement Learning par Ishibashi, Yoichi, Yano, Taro, Oyamada, Masafumi

Table des matières: “… employs an iterative cycle where a seed model generates algorithmic candidates as executable code…”
Accéder au texte intégral

LLM4EFFI: Leveraging Large Language Models to Enhance Code Efficiency and Correctness par Ye, Tong, Huang, Weigang, Zhang, Xuhong, Ma, Tengfei, Liu, Peiyu, Yin, Jianwei, Wang, Wenhai

Table des matières: “… in code generation. Current research primarily focuses on the correctness of generated code, while…”
Accéder au texte intégral

Large Language Model-Powered Evolutionary Code Optimization on a Phylogenetic Tree par Zhao, Leyi, Huang, Weijie, Guo, Yitong, Bian, Jiang, Wang, Chenghong, Zhang, Xuhong

Table des matières: “…Optimizing scientific computing algorithms for modern GPUs is a labor-intensive and iterative…”
Accéder au texte intégral