Search Results - Cutkosky, Ashok

Refine Results
  1. 1
    Chromatin extrusion explains key features of loop and domain formation in wild-type and engineered genomes

    Chromatin extrusion explains key features of loop and domain formation in wild-type and engineered genomes by Sanborn, Adrian L., Rao, Suhas S. P., Huang, Su-Chen, Durand, Neva C., Huntley, Miriam H., Jewett, Andrew I., Bochkov, Ivan D., Chinnappan, Dharmaraj, Cutkosky, Ashok, Li, Jian, Geeting, Kristopher P., Gnirke, Andreas, Melnikov, Alexandre, McKenna, Doug, Stamenova, Elena K., Lander, Eric S., Aiden, Erez Lieberman

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    Chromatin Extrusion Explains Key Features of Loop and Domain Formation in Wild‐type and Engineered Genomes

    Chromatin Extrusion Explains Key Features of Loop and Domain Formation in Wild‐type and Engineered Genomes by Sanborn, Adrian, Rao, Suhas, Huang, Su‐Chen, Durand, Neva, Huntley, Miriam, Jewett, Andrew, Bochkov, Ivan, Chinnappan, Dharmaraj, Cutkosky, Ashok, Li, Jian, Geeting, Kristopher, Gnirke, Andreas, Melnikov, Alexandre, McKenna, Douglas, Stamenova, Elena, Lander, Eric, Aiden, Erez Lieberman

    Published in The FASEB journal
    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 3
    Adam with model exponential moving average is effective for nonconvex optimization

    Adam with model exponential moving average is effective for nonconvex optimization by Ahn, Kwangjun, Cutkosky, Ashok

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Fully Unconstrained Online Learning

    Fully Unconstrained Online Learning by Cutkosky, Ashok, Mhammedi, Zakaria

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Random Scaling and Momentum for Non-smooth Non-convex Optimization

    Random Scaling and Momentum for Non-smooth Non-convex Optimization by Zhang, Qinzi, Cutkosky, Ashok

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Parameter-free Mirror Descent

    Parameter-free Mirror Descent by Jacobsen, Andrew, Cutkosky, Ashok

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Unconstrained Online Learning with Unbounded Losses

    Unconstrained Online Learning with Unbounded Losses by Jacobsen, Andrew, Cutkosky, Ashok

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Adaptive Online Learning with Varying Norms

    Adaptive Online Learning with Varying Norms by Cutkosky, Ashok

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Parameter-free Regret in High Probability with Heavy Tails

    Parameter-free Regret in High Probability with Heavy Tails by Zhang, Jiujia, Cutkosky, Ashok

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Momentum Aggregation for Private Non-convex ERM

    Momentum Aggregation for Private Non-convex ERM by Tran, Hoang, Cutkosky, Ashok

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Anytime Online-to-Batch Conversions, Optimism, and Acceleration

    Anytime Online-to-Batch Conversions, Optimism, and Acceleration by Cutkosky, Ashok

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Artificial Constraints and Lipschitz Hints for Unconstrained Online Learning

    Artificial Constraints and Lipschitz Hints for Unconstrained Online Learning by Cutkosky, Ashok

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Combining Online Learning Guarantees

    Combining Online Learning Guarantees by Cutkosky, Ashok

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tails

    High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tails by Cutkosky, Ashok, Mehta, Harsh

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization

    General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization by Ahn, Kwangjun, Magakyan, Gagik, Cutkosky, Ashok

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Better SGD using Second-order Momentum

    Better SGD using Second-order Momentum by Tran, Hoang, Cutkosky, Ashok

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Empirical Tests of Optimization Assumptions in Deep Learning

    Empirical Tests of Optimization Assumptions in Deep Learning by Tran, Hoang, Zhang, Qinzi, Cutkosky, Ashok

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Private Zeroth-Order Nonsmooth Nonconvex Optimization

    Private Zeroth-Order Nonsmooth Nonconvex Optimization by Zhang, Qinzi, Tran, Hoang, Cutkosky, Ashok

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Unconstrained Dynamic Regret via Sparse Coding

    Unconstrained Dynamic Regret via Sparse Coding by Zhang, Zhiyu, Cutkosky, Ashok, Paschalidis, Ioannis Ch

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Momentum Improves Normalized SGD

    Momentum Improves Normalized SGD by Cutkosky, Ashok, Mehta, Harsh

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: