5 of Latest Published Articles:
Artificial Intelligence
#ArtificialIntelligence
π Benchmarking Neural Network Robustness to Common Corruptions and Surface Variations
π₯ Dan Hendrycks, Thomas G. Dietterich
π PDF
π Sample-Efficient Reinforcement Learning with Stochastic Ensemble Value Expansion
π₯ Jacob Buckman, Danijar Hafner, George Tucker, Eugene Brevdo, Honglak Lee
π PDF
π Ranked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization
π₯ Alexandre Laterre, Yunguan Fu, Mohamed Khalil Jabri, Alain-Sam Cohen, David Kas, Karl Hajjar, Torbjorn S. Dahl, Amine Kerkeni, Karim Beguir
π PDF
π Encoding Spatial Relations from Natural Language
π₯ Tiago Ramalho, TomΓ‘Ε‘ KociskΓ½, Frederic Besse, S. M. Ali Eslami, GΓ‘bor Melis, Fabio Viola, Phil Blunsom, Karl Moritz Hermann
π PDF
π MIXGAN: Learning Concepts from Different Domains for Mixture Generation
π₯ Guang-Yuan Hao, Hong-Xing Yu, Wei-Shi Zheng
π PDF
#ArtificialIntelligence
AI Python & arXiv Channel
Artificial Intelligence
#ArtificialIntelligence
π Benchmarking Neural Network Robustness to Common Corruptions and Surface Variations
π₯ Dan Hendrycks, Thomas G. Dietterich
π PDF
π Sample-Efficient Reinforcement Learning with Stochastic Ensemble Value Expansion
π₯ Jacob Buckman, Danijar Hafner, George Tucker, Eugene Brevdo, Honglak Lee
π PDF
π Ranked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization
π₯ Alexandre Laterre, Yunguan Fu, Mohamed Khalil Jabri, Alain-Sam Cohen, David Kas, Karl Hajjar, Torbjorn S. Dahl, Amine Kerkeni, Karim Beguir
π PDF
π Encoding Spatial Relations from Natural Language
π₯ Tiago Ramalho, TomΓ‘Ε‘ KociskΓ½, Frederic Besse, S. M. Ali Eslami, GΓ‘bor Melis, Fabio Viola, Phil Blunsom, Karl Moritz Hermann
π PDF
π MIXGAN: Learning Concepts from Different Domains for Mixture Generation
π₯ Guang-Yuan Hao, Hong-Xing Yu, Wei-Shi Zheng
π PDF
#ArtificialIntelligence
AI Python & arXiv Channel
5 of Latest Published Articles:
Hardware Architecture
#HardwareArchitecture
π A New Paradigm for Fault-Tolerant Computing with Interconnect Crosstalks
π₯ Naveen Kumar Macha, Bhavana Tejaswini Repalle, Sandeep Geedipally, Rafael Rios, Mostafizur Rahman
π PDF
π Crosstalk based Fine-Grained Reconfiguration Techniques for Polymorphic Circuits
π₯ Naveen Kumar Macha, Sandeep Geedipally, Bhavana Repalle, Md Arif Iqbal, Wafi Danesh, Mostafizur Rahman
π PDF
π Best-Effort FPGA Programming: A Few Steps Can Go a Long Way
π₯ Jason Cong, Zhenman Fang, Yuchen Hao, Peng Wei, Cody Hao Yu, Chen Zhang, Peipei Zhou
π PDF
π FATE: Fast and Accurate Timing Error Prediction Framework for Low Power DNN Accelerator Design
π₯ Jeff Zhang, Siddharth Garg
π PDF
π Neuro-memristive Circuits for Edge Computing: A review
π₯ Olga Krestinskaya, Alex Pappachen James, Leon O. Chua
π PDF
#HardwareArchitecture
AI Python & arXiv Channel
Hardware Architecture
#HardwareArchitecture
π A New Paradigm for Fault-Tolerant Computing with Interconnect Crosstalks
π₯ Naveen Kumar Macha, Bhavana Tejaswini Repalle, Sandeep Geedipally, Rafael Rios, Mostafizur Rahman
π PDF
π Crosstalk based Fine-Grained Reconfiguration Techniques for Polymorphic Circuits
π₯ Naveen Kumar Macha, Sandeep Geedipally, Bhavana Repalle, Md Arif Iqbal, Wafi Danesh, Mostafizur Rahman
π PDF
π Best-Effort FPGA Programming: A Few Steps Can Go a Long Way
π₯ Jason Cong, Zhenman Fang, Yuchen Hao, Peng Wei, Cody Hao Yu, Chen Zhang, Peipei Zhou
π PDF
π FATE: Fast and Accurate Timing Error Prediction Framework for Low Power DNN Accelerator Design
π₯ Jeff Zhang, Siddharth Garg
π PDF
π Neuro-memristive Circuits for Edge Computing: A review
π₯ Olga Krestinskaya, Alex Pappachen James, Leon O. Chua
π PDF
#HardwareArchitecture
AI Python & arXiv Channel
5 of Latest Published Articles:
Computational Complexity
#ComputationalComplexity
π Tight bounds for popping algorithms
π₯ Heng Guo, Kun He
π PDF
π How long can optimal locally repairable codes be?
π₯ Venkatesan Guruswami, Chaoping Xing, Chen Yuan
π PDF
π The complexity of disjunctive linear Diophantine constraints
π₯ Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet
π PDF
π A Note on Degree vs Gap of Min-Rep Label Cover and Improved Inapproximability for Connectivity Problems
π₯ Pasin Manurangsi
π PDF
π Fast Hermite interpolation and evaluation over finite fields of characteristic two
π₯ Nicholas Coxon
π PDF
#ComputationalComplexity
AI Python & arXiv Channel
Computational Complexity
#ComputationalComplexity
π Tight bounds for popping algorithms
π₯ Heng Guo, Kun He
π PDF
π How long can optimal locally repairable codes be?
π₯ Venkatesan Guruswami, Chaoping Xing, Chen Yuan
π PDF
π The complexity of disjunctive linear Diophantine constraints
π₯ Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet
π PDF
π A Note on Degree vs Gap of Min-Rep Label Cover and Improved Inapproximability for Connectivity Problems
π₯ Pasin Manurangsi
π PDF
π Fast Hermite interpolation and evaluation over finite fields of characteristic two
π₯ Nicholas Coxon
π PDF
#ComputationalComplexity
AI Python & arXiv Channel